Optimization meets Statistics: Fast global convergence for high-dimensional statistical recovery
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Richard Samworth.
Many methods for solving high-dimensional statistical
inverse problems are based on convex optimization problems formed by
the weighted sum of a loss function with a norm-based regularizer.
Particular examples include $\ell_1$-based methods for sparse vectors
and matrices, nuclear norm for low-rank matrices, and various
combinations thereof for matrix decomposition and robust PCA . In this
talk, we describe an interesting connection between computational and
statistical efficiency, in particular showing that the same conditions
that guarantee that an estimator has good statistical error can also
be used to certify fast convergence of first-order optimization
methods up to statistical precision.
This talk is part of the Statistics series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|