Sparse power factorization: balancing peakiness and sample complexity
From MaRDI portal
Publication:2000543
DOI10.1007/S10444-019-09698-6zbMATH Open1409.94813arXiv1804.09097OpenAlexW2964073271WikidataQ127958976 ScholiaQ127958976MaRDI QIDQ2000543FDOQ2000543
Felix Krahmer, Jakob Geppert, Dominik Stöger
Publication date: 28 June 2019
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1804.09097
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
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- Robust sparse phase retrieval made easy
- Generalized power method for sparse principal component analysis
- Title not available (Why is that?)
- Sparse principal component analysis and iterative thresholding
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Optimal detection of sparse principal components in high dimension
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Low-rank matrix completion using alternating minimization
- Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Statistical and computational trade-offs in estimation of sparse principal components
- Blind Deconvolution Using Convex Programming
- High-dimensional analysis of semidefinite relaxations for sparse principal components
- Rapid, robust, and reliable blind deconvolution via nonconvex optimization
- Do semidefinite relaxations solve sparse PCA up to the information limit?
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
- Improved bounds for sparse recovery from subsampled random convolutions
- Self-calibration and biconvex compressive sensing
- Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization
- A flexible convex relaxation for phase retrieval
- Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization
- Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems
- Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
- Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
- Sparse PCA via covariance thresholding
- Blind Recovery of Sparse Signals From Subsampled Convolution
- Blind Demixing and Deconvolution at Near-Optimal Rate
- Convolutional Phase Retrieval via Gradient Descent
- Sparse power factorization: balancing peakiness and sample complexity
- Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness
Cited In (5)
- Sparse power factorization: balancing peakiness and sample complexity
- Riemannian thresholding methods for row-sparse and low-rank matrix recovery
- Jointly low-rank and bisparse recovery: Questions and partial answers
- Robust sensing of low-rank matrices with non-orthogonal sparse decomposition
- Proof methods for robust low-rank matrix recovery
Uses Software
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)
