6 citations · 8 across the 2 of their papers we have counts for
6 papers
Streaming Complexity of SVMs
Alexandr Andoni, Collin Burns, Yi Li +2
We study the space complexity of solving the bias-regularized SVM problem in the streaming model. This is a classic supervised learning problem that has drawn lots of attention, in…
Nearly Linear Row Sampling Algorithm for Quantile Regression
Yi Li, Ruosong Wang, Lin Yang +1
We give a row sampling algorithm for the quantile loss function with sample complexity nearly linear in the dimensionality of the data, improving upon the previous best algorithm w…
Input-Sparsity Low Rank Approximation in Schatten Norm
Yi Li, David Woodruff
We give the first input-sparsity time algorithms for the rank- low rank approximation problem in every Schatten norm. Specifically, for a given matrix , our algor…
Tight Bounds for the Subspace Sketch Problem with Applications
Yi Li, Ruosong Wang, David P. Woodruff
In the subspace sketch problem one is given an matrix with bit entries, and would like to compress it in an arbitrary way to build a small space data…
Deterministic Sparse Fourier Transform with an ell_infty Guarantee
Yi Li, Vasileios Nakos
In this paper we revisit the deterministic version of the Sparse Fourier Transform problem, which asks to read only a few entries of and design a recovery algo…
Embeddings of Schatten Norms with Applications to Data Streams
Yi Li, David P. Woodruff
Given an matrix , its Schatten- norm, , is defined as , where is the $i…