arXiv · 1802.09733
Sharp oracle inequalities for stationary points of nonconvex penalized M-estimators
Abstract
Many statistical estimation procedures lead to nonconvex optimization problems. Algorithms to solve these are often guaranteed to output a stationary point of the optimization problem. Oracle inequalities are an important theoretical instrument to asses the statistical performance of an estimator. Oracle results have focused on the theoretical properties of the uncomputable (global) minimum or maximum. In the present work a general framework used for convex optimization problems to derive oracle inequalities for stationary points is extended. A main new ingredient of these oracle inequalities is that they are sharp: they show closeness to the best approximation within the model plus a remainder term. We apply this framework to different estimation problems.
Explore related subjects
Keep this discovery
Andreas Elsener, Sara van de Geer. 2018-02-27. Sharp oracle inequalities for stationary points of nonconvex penalized M-estimators. https://arxiv.org/abs/1802.09733
Cite the original work for its findings. Save a collection to share your selection of sources.