A randomized progressive iterative regularization method for data fitting problems
By: Dakang Cen, Wenlong Zhang, Junbin Zhong
Potential Business Impact:
Fixes messy data to make better pictures.
In this work, we investigate data fitting problems with random noises. A randomized progressive iterative regularization method is proposed. It works well for large-scale matrix computations and converges in expectation to the least-squares solution. Furthermore, we present an optimal estimation for the regularization parameter, which inspires the construction of self-consistent algorithms without prior information. The numerical results confirm the theoretical analysis and show the performance in curve and surface fittings.
Similar Papers
A kinetic-based regularization method for data science applications
Machine Learning (CS)
Improves computer learning, even with messy information.
Deep regularization networks for inverse problems with noisy operators
Numerical Analysis
Makes blurry pictures sharp, super fast.
A new iterated Tikhonov regularization method for Fredholm integral equation of first kind
Numerical Analysis
Solves hard math problems faster and better.