Spotlight
Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima
Po-Ling Loh · Martin J Wainwright

Sat Dec 7th 03:34 -- 03:38 PM @ Harvey's Convention Center Floor, CC

We establish theoretical results concerning all local optima of various regularized M-estimators, where both loss and penalty functions are allowed to be nonconvex. Our results show that as long as the loss function satisfies restricted strong convexity and the penalty function satisfies suitable regularity conditions, any local optimum of the composite objective function lies within statistical precision of the true parameter vector. Our theory covers a broad class of nonconvex objective functions, including corrected versions of the Lasso for errors-in-variables linear models; regression in generalized linear models using nonconvex regularizers such as SCAD and MCP; and graph and inverse covariance matrix estimation. On the optimization side, we show that a simple adaptation of composite gradient descent may be used to compute a global optimum up to the statistical precision epsilon in log(1/epsilon) iterations, which is the fastest possible rate of any first-order method. We provide a variety of simulations to illustrate the sharpness of our theoretical predictions.

Author Information

Po-Ling Loh (University of Wisconsin - Madison)
Martin J Wainwright (UC Berkeley)

More from the Same Authors