# Stochastic optimization and sparse statistical recovery: Optimal algorithms for high dimensions

Alekh AgarwalSahand NegahbanMartin J. Wainwright

We develop and analyze stochastic optimization algorithms for problems in which the expected loss is strongly convex, and the optimum is (approximately) sparse. Previous approaches are able to exploit only one of these two structures, yielding a $\order(\pdim/T)$ convergence rate for strongly convex objectives in $\pdim$ dimensions and $\order(\sqrt{\spindex( \log\pdim)/T})$ convergence rate when the optimum is $\spindex$-sparse... (read more)

PDF Abstract

No code implementations yet. Submit your code now