Geometric Inference for General High-Dimensional Linear Inverse Problems
arXiv:1404.4408 · doi:10.1214/15-AOS1426
Abstract
This paper presents a unified geometric framework for the statistical analysis of a general ill-posed linear inverse model which includes as special cases noisy compressed sensing, sign vector recovery, trace regression, orthogonal matrix estimation, and noisy matrix completion. We propose computationally feasible convex programs for statistical inference including estimation, confidence intervals and hypothesis testing. A theoretical framework is developed to characterize the local estimation rate of convergence and to provide statistical inference guarantees. Our results are built based on the local conic geometry and duality. The difficulty of statistical inference is captured by the geometric characterization of the local tangent cone through the Gaussian width and Sudakov minoration estimate.
arXiv comment39 pages, 6 figures
References in corpus (19)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Simultaneous analysis of Lasso and Dantzig selector
- The Convex Geometry of Linear Inverse Problems
- On asymptotically optimal confidence regions and tests for high-dimensional models
- A Simpler Approach to Matrix Completion
- Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
- Matrix estimation by Universal Singular Value Thresholding
- Estimation of high-dimensional low-rank matrices
- Sparse PCA: Optimal rates and adaptive estimation
- Statistical significance in high-dimensional linear models
- A new perspective on least squares under convex constraint
- Matrix Completion via Max-Norm Constrained Optimization
- An adaptation theory for nonparametric confidence intervals
- Learning subgaussian classes : Upper and minimax bounds
- Minimax estimation of linear functionals over nonconvex parameter spaces
- Living on the edge: Phase transitions in convex programs with random data
- Simple Bounds for Noisy Linear Inverse Problems with Exact Side Information
- Estimation in high dimensions: a geometric perspective
- Volume Ratio, Sparsity, and Minimaxity under Unitarily Invariant Norms
Cited by in corpus (7)
- Inference and Uncertainty Quantification for Noisy Matrix Completion
- Inference for Heterogeneous Effects using Low-Rank Estimation of Factor Slopes
- Optimal Structured Principal Subspace Estimation: Metric Entropy and Minimax Rates
- Consistent Risk Estimation in Moderately High-Dimensional Linear Regression
- Structured Matrix Recovery via the Generalized Dantzig Selector
- Confidence Region of Singular Subspaces for Low-rank Matrix Regression
- Linear signal recovery from -bit-quantized linear measurements: precise analysis of the trade-off between bit depth and number of measurements