Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
From MaRDI portal
Publication:4603729
DOI10.1093/IMAIAI/IAW012zbMath1386.94020arXiv1506.08159OpenAlexW2963890912MaRDI QIDQ4603729
Sohail Bahmani, Justin Romberg
Publication date: 19 February 2018
Published in: Information and Inference (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.08159
convex relaxationminimax ratehigh-dimensional estimationrestricted isometriessimultaneously low-rank and sparse matrices
Computational methods for sparse matrices (65F50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (5)
Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements ⋮ Robust sensing of low-rank matrices with non-orthogonal sparse decomposition ⋮ Riemannian thresholding methods for row-sparse and low-rank matrix recovery ⋮ Sparse power factorization: balancing peakiness and sample complexity ⋮ Jointly low-rank and bisparse recovery: Questions and partial answers
Uses Software
Cites Work
- Estimation of high-dimensional low-rank matrices
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Iterative hard thresholding for compressed sensing
- High-dimensional analysis of semidefinite relaxations for sparse principal components
- A simple proof of the restricted isometry property for random matrices
- Templates for convex cone problems with applications to sparse signal recovery
- Adaptive estimation of a quadratic functional by model selection.
- Optimal estimation and rank detection for sparse spiked covariance matrices
- Sparse PCA: optimal rates and adaptive estimation
- Exact matrix completion via convex optimization
- Convex Recovery of a Structured Signal from Independent Random Linear Measurements
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Sparse Signal Recovery from Quadratic Measurements via Convex Programming
- Exact and Stable Covariance Estimation From Quadratic Sampling via Convex Programming
- Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Lifting for Blind Deconvolution in Random Mask Imaging: Identifiability and Convex Relaxation
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- GESPAR: Efficient Phase Retrieval of Sparse Signals
- Robust Recovery of Signals From a Structured Union of Subspaces
- On Consistency and Sparsity for Principal Components Analysis in High Dimensions
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
This page was built for publication: Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
