paper-with-me

Papers

Quantile-Based Randomized Kaczmarz for Corrupted Tensor Linear Systems

2025-03-23 · Alejandra Castillo, Jamie Haddock, Iryna Hartsock, Paulina Hoyos, Lara Kassab, Alona Kryshchenko, Kamila Larripa, Deanna Needell, Shambhavi Suryanarayanan, Karamatou Yacoubou Djima

The reconstruction of tensor-valued signals from corrupted measurements, known as tensor regression, has become essential in many multi-modal applications such as hyperspectral image reconstruction and medical imaging. In this work, we address the tensor linear system problem $\mathcal{A} \mathcal{X}=\mathcal{B}$, where $\mathcal{A}$ is a measurement operator, $\mathcal{X}$ is the unknown tensor-valued signal, and $\mathcal{B}$ contains the measurements, possibly corrupted by arbitrary errors. Such corruption is common in large-scale tensor data, where transmission, sensory, or storage errors are rare per instance but likely over the entire dataset and may be arbitrarily large in magnitude. We extend the Kaczmarz method, a popular iterative algorithm for solving large linear systems, to develop a Quantile Tensor Randomized Kaczmarz (QTRK) method robust to large, sparse corruptions in the observations $\mathcal{B}$. This approach combines the tensor Kaczmarz framework with quantile-based statistics, allowing it to mitigate adversarial corruptions and improve convergence reliability. We also propose and discuss the Masked Quantile Randomized Kaczmarz (mQTRK) variant, which selectively applies partial updates to handle corruptions further. We present convergence guarantees, discuss the advantages and disadvantages of our approaches, and demonstrate the effectiveness of our methods through experiments, including an application for video deblurring.

📄 PDF Abstract BibTeX arXiv:2503.18190

Code (1)

lara-kassab/qtrk-code 공식 구현

Tasks

DeblurringImage ReconstructionVideo Deblurring

Similar Papers 제목 키워드 기반

Extension of Sparse Randomized Kaczmarz Algorithm for Multiple Measurement Vectors

2014-01-10 · Hemant Kumar Aggarwal, Angshul Majumdar

The Kaczmarz algorithm is popular for iteratively solving an overdetermined system of linear equations. The traditional Kaczmarz algorithm can approximate the solution in few sweeps through the equations but a randomized…

Face RecognitionFairness

Linear Discriminant Analysis with the Randomized Kaczmarz Method

2022-11-10 · Jocelyn T. Chi, Deanna Needell

We present a randomized Kaczmarz method for linear discriminant analysis (rkLDA), an iterative randomized approach to binary-class Gaussian model linear discriminant analysis (LDA) for very large data. We harness a least…

An optimal scheduled learning rate for a randomized Kaczmarz algorithm

2022-02-24 · Nicholas F. Marshall, Oscar Mickelin

We study how the learning rate affects the performance of a relaxed randomized Kaczmarz algorithm for solving $A x \approx b + \varepsilon$, where $A x =b$ is a consistent linear system and $\varepsilon$ has independent …

Randomized batch-sampling Kaczmarz methods for solving linear systems

2025-11-13 · Dong-Yue Xie, Xi Yang arxiv

To conduct a more in-depth investigation of randomized solvers for solving linear systems, we adopt a unified randomized batch-sampling Kaczmarz framework with per-iteration costs as low as cyclic block methods, and deve…

Rows vs Columns for Linear Systems of Equations - Randomized Kaczmarz or Coordinate Descent?

2014-06-20 · Aaditya Ramdas

This paper is about randomized iterative algorithms for solving a linear system of equations $X \beta = y$ in different settings. Recent interest in the topic was reignited when Strohmer and Vershynin (2009) proved the l…