2 citations · 7 across the 18 of their papers we have counts for
4 papers · 1 filter
Sketching Algorithms for Sparse Dictionary Learning: PTAS and Turnstile Streaming
Gregory Dexter, Petros Drineas, David P. Woodruff +1
Sketching algorithms have recently proven to be a powerful approach both for designing low-space streaming algorithms as well as fast polynomial time approximation schemes (PTAS).…
Performance of Regularization for Sparse Convex Optimization
Kyriakos Axiotis, Taisuke Yasuda
Despite widespread adoption in practice, guarantees for the LASSO and Group LASSO are strikingly lacking in settings beyond statistical problems, and these algorithms are usually c…
Sharper Bounds for Sensitivity Sampling
David P. Woodruff, Taisuke Yasuda
In large scale machine learning, random sampling is a popular way to approximate datasets by a small representative subset of examples. In particular, sensitivity sampling is an in…
New Subset Selection Algorithms for Low Rank Approximation: Offline and Online
David P. Woodruff, Taisuke Yasuda
Subset selection for the rank approximation of an matrix offers improvements in the interpretability of matrices, as well as a variety of computational savings.…