3 papers
cs.DS2025
Ridge Leverage Score Sampling for Subspace Approximation
David P. Woodruff, Taisuke Yasuda
The subspace approximation problem is an NP-hard low rank approximation problem that generalizes the median hyperplane (), principal component analysis (), a…
cs.LG2025
SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization
Taisuke Yasuda, Kyriakos Axiotis, Gang Fu +2
Neural network pruning is a key technique towards engineering large yet scalable, interpretable, and generalizable models. Prior work on the subject has developed largely along two…
cs.DS2025
John Ellipsoids via Lazy Updates
David P. Woodruff, Taisuke Yasuda
We give a faster algorithm for computing an approximate John ellipsoid around points in dimensions. The best known prior algorithms are based on repeatedly computing the le…