Sparse power factorization: balancing peakiness and sample complexity
From MaRDI portal
Publication:2000543
Abstract: In many applications, one is faced with an inverse problem, where the known signal depends in a bilinear way on two unknown input vectors. Often at least one of the input vectors is assumed to be sparse, i.e., to have only few non-zero entries. Sparse Power Factorization (SPF), proposed by Lee, Wu, and Bresler, aims to tackle this problem. They have established recovery guarantees for a somewhat restrictive class of signals under the assumption that the measurements are random. We generalize these recovery guarantees to a significantly enlarged and more realistic signal class at the expense of a moderately increased number of measurements.
Recommendations
- Phase retrieval for sparse signals
- Simple bounds for recovering low-complexity models
- The recovery of complex sparse signals from few phaseless measurements
- On sparse reconstruction from Fourier and Gaussian measurements
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Cites work
- A flexible convex relaxation for phase retrieval
- Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
- Blind Deconvolution Using Convex Programming
- Blind Demixing and Deconvolution at Near-Optimal Rate
- Blind Recovery of Sparse Signals From Subsampled Convolution
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Convolutional Phase Retrieval via Gradient Descent
- Do semidefinite relaxations solve sparse PCA up to the information limit?
- Generalized power method for sparse principal component analysis
- Hard thresholding pursuit: an algorithm for compressive sensing
- High-dimensional analysis of semidefinite relaxations for sparse principal components
- Improved bounds for sparse recovery from subsampled random convolutions
- Low-rank matrix completion using alternating minimization
- Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
- Optimal detection of sparse principal components in high dimension
- Optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems
- Optimal solutions for sparse principal component analysis
- Phase retrieval via Wirtinger flow: theory and algorithms
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
- Robust sparse phase retrieval made easy
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Self-calibration and biconvex compressive sensing
- Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
- Sparse PCA via covariance thresholding
- Sparse power factorization: balancing peakiness and sample complexity
- Sparse principal component analysis and iterative thresholding
- Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness
- Statistical and computational trade-offs in estimation of sparse principal components
- Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
Cited in
(5)- Jointly low-rank and bisparse recovery: questions and partial answers
- Sparse power factorization: balancing peakiness and sample complexity
- Riemannian thresholding methods for row-sparse and low-rank matrix recovery
- Robust sensing of low-rank matrices with non-orthogonal sparse decomposition
- Proof methods for robust low-rank matrix recovery
This page was built for publication: Sparse power factorization: balancing peakiness and sample complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000543)
