Quantile-based Random Kaczmarz for corrupted linear systems of equations

From MaRDI portal



Abstract: We consider linear systems Ax=b where AinmathbbRmimesn consists of normalized rows, |ai|ell2=1, and where up to entries of b have been corrupted (possibly by arbitrarily large numbers). Haddock, Needell, Rebrova and Swartworth propose a quantile-based Random Kaczmarz method and show that for certain random matrices A it converges with high likelihood to the true solution. We prove a deterministic version by constructing, for any matrix A, a number such that there is convergence for all perturbations with . Assuming a random matrix heuristic, this proves convergence for tall Gaussian matrices with up to sim0.5% corruption (a number that can likely be improved).












This page was built for publication: Quantile-based Random Kaczmarz for corrupted linear systems of equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5878259)