2 citations · 2 across the 4 of their papers we have counts for
6 papers
Improved Algorithms for Low Rank Approximation from Sparsity
David P. Woodruff, Taisuke Yasuda
We overcome two major bottlenecks in the study of low rank approximation by assuming the low rank factors themselves are sparse. Specifically, (1) for low rank approximation with s…
Exponentially Improved Dimensionality Reduction for : Subspace Embeddings and Independence Testing
Yi Li, David P. Woodruff, Taisuke Yasuda
Despite many applications, dimensionality reduction in the -norm is much less understood than in the Euclidean norm. We give two new oblivious dimensionality reduction tech…
Graph Spanners in the Message-Passing Model
Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
Graph spanners are sparse subgraphs which approximately preserve all pairwise shortest-path distances in an input graph. The notion of approximation can be additive, multiplicative…
The Query Complexity of Mastermind with Distances
Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
Consider a variant of the Mastermind game in which queries are distances, rather than the usual Hamming distance. That is, a codemaker chooses a hidden vector $\mathbf{y}\…
Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel -means Clustering
Manuel Fernandez, David P. Woodruff, Taisuke Yasuda
We present tight lower bounds on the number of kernel evaluations required to approximately solve kernel ridge regression (KRR) and kernel -means clustering (KKMC) on input…
The nonlinear stability regime of the viscous Faraday wave problem
David Altizio, Ian Tice, Xinyu Wu +1
This paper concerns the dynamics of a layer of incompressible viscous fluid lying above a vertically oscillating rigid plane and with an upper boundary given by a free surface. We…