Metraipolis › archive › dc_d0e050dd8dbe

Weighted Randomized Kaczmarz for Sparsely Corrupted Linear Systems — arXiv:2611.03889

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03889
License (as archived)
CC0-1.0
Archived
2026-11-04T12:48:37.838Z
SHA-256 of the archived text
599bec47e3ee3b6fa0339acb8d940dbc6d737263aab976e8f4d8fb9f9adf4655
Stable URL of this page
https://metraipolis.com/documento/dc_d0e050dd8dbe

How to cite

Weighted Randomized Kaczmarz for Sparsely Corrupted Linear Systems — arXiv:2611.03889 — arXiv (en), https://arxiv.org/abs/2611.03889 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d0e050dd8dbe (Metraipolis archive dc_d0e050dd8dbe, sha256 599bec47e3ee3b6fa0339acb8d940dbc6d737263aab976e8f4d8fb9f9adf4655)
BibTeX
@misc{dcd0e050dd8dbe,
  title = {Weighted Randomized Kaczmarz for Sparsely Corrupted Linear Systems — arXiv:2611.03889},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03889},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d0e050dd8dbe; sha256 599bec47e3ee3b6fa0339acb8d940dbc6d737263aab976e8f4d8fb9f9adf4655},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03889. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper, we introduce a generalized weighted randomized Kaczmarz framework to approximate solutions to overdetermined linear systems whose measurements are perturbed by sparse, additive corruptions. The proposed framework samples equations with probabilities proportional to a user-defined weighting function of their corresponding residual magnitudes. Our work focuses on weighting functions that will reduce the influence of potentially corrupted equations, and provides analyses for a general class of non-increasing weighting functions. We derive one-step expected squared error bounds that separate progress on uncorrupted equations from the contribution of corrupted equations, and provide sufficient conditions for geometric convergence under one specific family of weighting functions -- threshold weighting. We also investigate adaptive exponential weights scaled by the median or median absolute deviation of residual magnitudes, requiring no prior knowledge of the corruption fraction or magnitudes. Lastly, we consider a family of inverse residual weighting functions. Numerical experiments demonstrate the benefit of such a generalized framework in its flexibility in developing approaches for settings in which information about the corruptions is known or unknown.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2611.03889 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T12:32:17.119Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).