Image de couverture de livre

Accelerating Power Method with Fast Sketching for Stronger Low-Rank Approximation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chenakkod, Shabarish, Dereziński, Michał
Format:	Preprint
Publié:	2026
Sujets:	Numerical Analysis Data Structures and Algorithms Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
par: Chenakkod, Shabarish, et autres
Publié: (2024)

Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
par: Chenakkod, Shabarish, et autres
Publié: (2025)

Optimal Embedding Dimension for Sparse Subspace Embeddings
par: Chenakkod, Shabarish, et autres
Publié: (2023)

Well-Conditioned Oblivious Perturbations in Linear Space
par: Chenakkod, Shabarish, et autres
Publié: (2026)

Distributed Least Squares in Small Space via Sketching and Bias Reduction
par: Garg, Sachin, et autres
Publié: (2024)

Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
par: Dereziński, Michał, et autres
Publié: (2024)

Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure
par: Dereziński, Michał, et autres
Publié: (2025)

Solving Dense Linear Systems Faster Than via Preconditioning
par: Dereziński, Michał, et autres
Publié: (2023)

Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nyström Method
par: Garg, Sachin, et autres
Publié: (2025)

Randomized Kaczmarz Methods with Beyond-Krylov Convergence
par: Dereziński, Michał, et autres
Publié: (2025)

Towards Universal Convergence of Backward Error in Linear System Solvers
par: Dereziński, Michał, et autres
Publié: (2026)

Fine-grained Analysis and Faster Algorithms for Iteratively Solving Linear Systems
par: Dereziński, Michał, et autres
Publié: (2024)

Sublinear Time Low-Rank Approximation of Hankel Matrices
par: Kapralov, Michael, et autres
Publié: (2025)

Sublinear Time Low-Rank Approximation of Toeplitz Matrices
par: Musco, Cameron, et autres
Publié: (2024)

Revisiting Approximate Leverage Score Sketching for Matrix Least Squares
par: Larsen, Brett W., et autres
Publié: (2022)

Perturbation Bounds for Low-Rank Inverse Approximations under Noise
par: Tran, Phuc, et autres
Publié: (2025)

Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacy
par: Tran, Phuc, et autres
Publié: (2025)

Private Low-Rank Approximation for Covariance Matrices, Dyson Brownian Motion, and Eigenvalue-Gap Bounds for Gaussian Perturbations
par: Mangoubi, Oren, et autres
Publié: (2025)

Fast One-Pass Sparse Approximation of the Top Eigenvectors of Huge Approximately Low-Rank Matrices? Yes, $MAM^*$!
par: Boahen, Edem, et autres
Publié: (2025)

The matrix-vector complexity of $Ax=b$
par: Dereziński, Michał, et autres
Publié: (2026)

Stability of the Lanczos Method for Matrix Function Approximation
par: Musco, Cameron, et autres
Publié: (2017)

Preserving Extreme Singular Values with One Oblivious Sketch
par: Mango, John M., et autres
Publié: (2025)

Sinkhorn Algorithm for Sequentially Composed Optimal Transports
par: Watanabe, Kazuki, et autres
Publié: (2024)

On the Robustness of the Successive Projection Algorithm
par: Barbarino, Giovanni, et autres
Publié: (2024)

Black-Box $k$-to-$1$-PCA Reductions: Theory and Applications
par: Jambulapati, Arun, et autres
Publié: (2024)

Query Efficient Structured Matrix Learning
par: Amsel, Noah, et autres
Publié: (2025)

Arithmetical Binary Decision Tree Traversals
par: Zhang, Jinxiong
Publié: (2022)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
par: Pham, Ninh, et autres
Publié: (2025)

Fast algorithms for least square problems with Kronecker lower subsets
par: Malik, Osman Asif, et autres
Publié: (2022)

Linear Systems and Eigenvalue Problems: Open Questions from a Simons Workshop
par: Amsel, Noah, et autres
Publié: (2026)

Fast Approximate Determinants Using Rational Functions
par: Colthurst, Thomas, et autres
Publié: (2024)

Algorithmic warm starts for Hamiltonian Monte Carlo
par: Zhang, Matthew S., et autres
Publié: (2026)

Convergence of a L2 regularized Policy Gradient Algorithm for the Multi Armed Bandit
par: Anita, Stefana, et autres
Publié: (2024)

Iterative Refinement for $\ell_p$-norm Regression
par: Adil, Deeksha, et autres
Publié: (2019)

On computing and the complexity of computing higher-order $U$-statistics, exactly
par: Chen, Xingyu, et autres
Publié: (2025)

Lower bounds for trace estimation via Block Krylov and other methods
par: Yu, Shi Jie
Publié: (2025)

Shifted Composition III: Local Error Framework for KL Divergence
par: Altschuler, Jason M., et autres
Publié: (2024)

Algorithms and data structures for automatic precision estimation of neural networks
par: Netay, Igor V.
Publié: (2025)

Reweighted Solutions for Weighted Low Rank Approximation
par: Woodruff, David P., et autres
Publié: (2024)

On Socially Fair Low-Rank Approximation and Column Subset Selection
par: Song, Zhao, et autres
Publié: (2024)