The Advantages of Fresh Sketching for Ridge Regression
Not on the map. Why?
Abstract (arXiv)
Over the past 25 years, sketching and sampling have become widely used tools for accelerating large-scale regression. In iterative randomized solvers, a basic design choice is whether to textitreuse the same sketch or draw textitfresh randomness at every step. For (under-constrained) iterative ridge regression with column sampling, whether fresh sketches offer provable advantages has remained open: textitWe show that they do. Fresh sketching lets us analyze error only along the current residual solution, rather than uniformly over the entire Gram matrix. This directional view yields sharper convergence guarantees for leverage score and ridge leverage score sampling and, more importantly, leads to residual-aware sampling rules. By minimizing the variance of the relevant sketched matrix-vector product, we derive an oracle distribution and practical approximations to the oracle distribution, including a mixture sampling distribution with (somewhat weaker) convergence guarantees. Experiments on synthetic and real data, including ridge probes on Qwen2.5 representations, support our theory, showing substantially faster convergence.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 46 references that are in the map. First posted on arXiv 29 Sep 2026.
Builds on
24 of 46 references.
References · 24
- 2021Probing Classifiers: Promises, Shortcomings, and Advancescited by 876
- 2015An Introduction to Matrix Concentration Inequalitiescited by 397
- 2023Language Models Represent Space and Timecited by 316
- 2014Sketching as a Tool for Numerical Linear Algebracited by 288
- 2015Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Samplingcited by 46
- 2016Faster Kernel Ridge Regression Using Sketching and Preconditioningcited by 44
- 2020Determinantal Point Processes in Randomized Numerical Linear Algebracited by 41
- 2023Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Softwarecited by 38
- 2015Optimal approximate matrix product in terms of stable rankcited by 37
- 2014Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squarescited by 34
- 2024Language Models Encode the Value of Numbers Linearlycited by 20
- 2016Sharper Bounds for Regularized Data Fittingcited by 19
12 more
- 2017Lectures on Randomized Numerical Linear Algebracited by 19
- 2020Sparse sketches with small inversion biascited by 19
- 2016Solving Ridge Regression using Sketched Preconditioned SVRGcited by 15
- 2021Adaptive Newton Sketch: Linear-time Optimization with Quadratic Convergence and Effective Hessian Dimensionalitycited by 14
- 2017Sketched Ridge Regression: Optimization Perspective, Statistical Perspective, and Model Averagingcited by 13
- 2023Optimal Embedding Dimension for Sparse Subspace Embeddingscited by 11
- 2019Faster Least Squares Optimizationcited by 8
- 2016Sketching Meets Random Projection in the Dual: A Provable Recovery Algorithm for Big and High-dimensional Datacited by 6
- 2022Sketching Algorithms and Lower Bounds for Ridge Regressioncited by 4
- 2024Optimal Oblivious Subspace Embeddings with Near-optimal Sparsitycited by 4
- 2025Fundamental Bias in Inverting Random Sampling Matrices with Application to Sub-sampled Newtoncited by 2
- 2025Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factorscited by 2
Built on by
Not cited yet.