ResearchTrend.AI
Optimal Embedding Dimension for Sparse Subspace Embeddings

Optimal Embedding Dimension for Sparse Subspace Embeddings

Shabarish Chenakkod
Michal Dereziñski
Xiaoyu Dong
M. Rudelson
ArXivPDFHTML

Papers citing "Optimal Embedding Dimension for Sparse Subspace Embeddings"

4 / 4 papers shown
Title
Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
Michal Dereziñski
Christopher Musco
Jiaming Yang
75
2
0
09 May 2024
Stochastic Variance-Reduced Newton: Accelerating Finite-Sum Minimization with Large Batches
Stochastic Variance-Reduced Newton: Accelerating Finite-Sum Minimization with Large Batches
Michal Derezinski
65
6
0
06 Jun 2022
Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
Nadiia Chepurko
K. Clarkson
Praneeth Kacham
David P. Woodruff
26
10
0
16 Jul 2021
Query Complexity of Least Absolute Deviation Regression via Robust Uniform Convergence
Query Complexity of Least Absolute Deviation Regression via Robust Uniform Convergence
Xue Chen
Michal Derezinski
23
31
0
03 Feb 2021