294 citations · 389 across the 13 of their papers we have counts for
Showing 2018Show all
2 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…
math.ST2018
Learning tensors from partial binary measurements
Navid Ghadermarzy, Yaniv Plan, Ozgur Yilmaz
In this paper we generalize the 1-bit matrix completion problem to higher order tensors. We prove that when a bounded rank-, order- tensor in $\mathbb{R}^{N} \ti…