RPLSS: A randomized projected linear systems solver

arXiv:2607.06917 2026 Optimization 1 ideas extracted · analyzed Aug 30, 2026

What the math gives to ML

The paper's transferable asset is a projected randomized coordinate solver that stores previously discovered search directions and removes their contribution before accepting a new direction. Unlike ordinary randomized Kaczmarz or coordinate descent, the update is globally corrected by an explicit Gram-matrix projection, which can prevent repeated work in already-explained subspaces and can terminate after a finite number of independent directions. The most plausible neural-network use is not generic nonlinear training, but solving least-squares Gauss–Newton subproblems for a linear output head, LoRA adapter, or small last-layer block using minibatch Jacobian columns and partial parameter access.

Ideas from this paper

✓✓ Beats tuned baseline 2026

Projected Randomized Gauss–Newton Updates

Replace ordinary randomized coordinate descent inside a least-squares neural subproblem with RPLSS's projected direction update. Each sampled parameter coordinate generates a Jacobian column, while the stored matrix P removes components already covered by previous updates; this should reduce redundant coordinate steps and improve convergence for linear heads, LoRA modules, and locally linearized fine-tuning.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: RPLSS: A randomized projected linear systems solver arXiv:2607.06917