New recursive preconditioning algorithms solve k-well-conditioned linear systems and regressions in Õ(d² + k^ω) time, matching the conditional lower bound and yielding the first nearly-linear-time nuclear norm approximation.
Optimal oblivious subspace embeddings with near-optimal sparsity
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure
New recursive preconditioning algorithms solve k-well-conditioned linear systems and regressions in Õ(d² + k^ω) time, matching the conditional lower bound and yielding the first nearly-linear-time nuclear norm approximation.