betaFeedback

WorksMathematics

Beyond the error horizon: averaged quantile Kaczmarz methods for corrupted and noisy linear systems

Abstract

Linear systems and least-squares problems can contain measurement errors of different scales: a few measurements may be highly unreliable, while small noise affects every measurement. Residual-based iterative filtering can remove the influence of sparse corruption, but its accuracy is limited by a noise-dependent error horizon. We study how averaging and relaxation reduce this horizon in averaged quantile randomized Kaczmarz (AQRK), which filters equations by residual quantiles and averages a batch of single-row updates. Filtering, however, introduces an update bias that averaging alone cannot remove. We show that re-querying the accepted equations can remove this bias, and when the corruption is sparse enough relative to the conditioning of the matrix and large enough relative to the noise, we prove that AQRK with re-queried residuals reduces the horizon as averaging does without the corruption: its error decays to a horizon proportional to α/s\sqrt{α/s}, where αα is the stepsize and ss the update batch size. Further, decreasing stepsizes or increasing batches gives convergence to the solution of the clean system. Numerical experiments support the theory and examine settings beyond it, including noise that cannot be re-queried and the corrupted low-rank tensor fitting problem. In the latter, AQRK inner solves succeed where standard alternating least-squares solvers and single-row robust updates fail.

Paper details

vlnc:W_uad4eemj
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…