Geometric inference for general high-dimensional linear inverse problems
From MaRDI portal
Publication:309721
DOI10.1214/15-AOS1426zbMath1357.62235arXiv1404.4408OpenAlexW1525725047MaRDI QIDQ309721
Tengyuan Liang, Alexander Rakhlin, T. Tony Cai
Publication date: 7 September 2016
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.4408
statistical inferenceconvex relaxationhigh-dimensional statisticslinear inverse problemsconic geometrygeometric functional analysis
Related Items
Inference for low-rank tensors -- no need to debias, Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information, Geometric inference for general high-dimensional linear inverse problems, Unnamed Item, Linear regression with sparsely permuted data, Rate optimal estimation and confidence intervals for high-dimensional regression with missing covariates, On the robustness of minimum norm interpolators and regularized empirical risk minimizers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On asymptotically optimal confidence regions and tests for high-dimensional models
- Matrix completion via max-norm constrained optimization
- Geometric inference for general high-dimensional linear inverse problems
- Statistical significance in high-dimensional linear models
- Von Neumann entropy penalization and low-rank matrix estimation
- Statistics for high-dimensional data. Methods, theory and applications.
- Estimation of high-dimensional low-rank matrices
- A statistical perspective on ill-posed inverse problems (with discussion)
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Speed of estimation in positron emission tomography and related inverse problems
- NP is as easy as detecting unique solutions
- Orthogonal Procrustes rotation for two or more matrices
- Statistical estimation and optimal recovery
- Information-theoretic determination of minimax rates of convergence
- An adaptation theory for nonparametric confidence intervals
- On complexity of unconstrained hyperbolic 0--1 programming problems
- Minimax estimation of linear functionals over nonconvex parameter spaces.
- The convex geometry of linear inverse problems
- How well can we estimate a sparse vector?
- Probability of unique integer solution to a system of linear equations
- Matrix estimation by universal singular value thresholding
- Simultaneous analysis of Lasso and Dantzig selector
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
- Majorizing measures: The generic chaining
- Exact matrix completion via convex optimization
- Confidence Intervals and Hypothesis Testing for High-Dimensional Regression
- Volume Ratio, Sparsity, and Minimaxity Under Unitarily Invariant Norms
- Robust principal component analysis?
- A Constrainedℓ1Minimization Approach to Sparse Precision Matrix Estimation
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Procrustes Problems
- Living on the edge: phase transitions in convex programs with random data
- Inferring Rankings Using Constrained Sensing
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
