Statistical Limits of Convex Relaxations

03/04/2015
by   Zhaoran Wang, et al.
0

Many high dimensional sparse learning problems are formulated as nonconvex optimization. A popular approach to solve these nonconvex optimization problems is through convex relaxations such as linear and semidefinite programming. In this paper, we study the statistical limits of convex relaxations. Particularly, we consider two problems: Mean estimation for sparse principal submatrix and edge probability estimation for stochastic block model. We exploit the sum-of-squares relaxation hierarchy to sharply characterize the limits of a broad class of convex relaxations. Our result shows statistical optimality needs to be compromised for achieving computational tractability using convex relaxations. Compared with existing results on computational lower bounds for statistical problems, which consider general polynomial-time algorithms and rely on computational hardness hypotheses on problems like planted clique detection, our theory focuses on a broad class of convex relaxations and does not rely on unproven hypotheses.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/30/2015

Sharp Computational-Statistical Phase Transitions via Oracle Computational Model

We study the fundamental tradeoffs between computational tractability an...
research
02/28/2020

The estimation error of general first order methods

Modern large-scale statistical models require to estimate thousands to m...
research
01/01/2018

Statistical and Computational Limits for Sparse Matrix Detection

This paper investigates the fundamental limits for detecting a high-dime...
research
11/11/2019

Stochastic Difference-of-Convex Algorithms for Solving nonconvex optimization problems

The paper deals with stochastic difference-of-convex functions programs,...
research
12/27/2022

Optimal Convex and Nonconvex Regularizers for a Data Source

In optimization-based approaches to inverse problems and to statistical ...
research
03/11/2015

Optimal prediction for sparse linear models? Lower bounds for coordinate-separable M-estimators

For the problem of high-dimensional sparse linear regression, it is know...
research
12/18/2017

Misspecified Nonconvex Statistical Optimization for Phase Retrieval

Existing nonconvex statistical optimization theory and methods crucially...

Please sign up or login with your details

Forgot password? Click here to reset