294 citations · 389 across the 13 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2018★ 21 cited
Tight Analyses for Non-Smooth Stochastic Gradient Descent
Nicholas J. A. Harvey, Christopher Liaw, Yaniv Plan +1
Consider the problem of minimizing functions that are Lipschitz and strongly convex, but not necessarily differentiable. We prove that after steps of stochastic gradient descen…
cs.LG2017
Near-optimal sample complexity for convex tensor completion
Navid Ghadermarzy, Yaniv Plan, Özgür Yılmaz
We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-, order-, tensor where $r=O…
cs.LG2016
Average-case Hardness of RIP Certification
Tengyao Wang, Quentin Berthet, Yaniv Plan
The restricted isometry property (RIP) for design matrices gives guarantees for optimal recovery in sparse linear models. It is of high interest in compressed sensing and statistic…