Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
Nadiia Chepurko, Kenneth L. Clarkson, Praneeth Kacham +1
In the numerical linear algebra community, it was suggested that to obtain nearly optimal bounds for various problems such as rank computation, finding a maximal linearly independe…
cs.DS2020
Reduced-Rank Regression with Operator Norm Error
Praneeth Kacham, David P. Woodruff
A common data analysis task is the reduced-rank regression problem: where and $B \in \mathbb{R}^{n \times d…