Sparse power factorization: balancing peakiness and sample complexity

DOI10.1007/s10444-019-09698-6zbMath1409.94813arXiv1804.09097OpenAlexW2964073271WikidataQ127958976 ScholiaQ127958976MaRDI QIDQ2000543

Felix Krahmer, Jakob Geppert, Dominik Stöger

Publication date: 28 June 2019

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.09097

zbMATH Keywords

compressed sensingbilinear inverse problemssparse power factorization

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (5)

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 ⋮ Proof methods for robust low-rank matrix recovery

Uses Software

• CoSaMP
• SparsePR
• Wirtinger Flow

Cites Work

• Unnamed Item
• Statistical and computational trade-offs in estimation of sparse principal components
• Robust sparse phase retrieval made easy
• Sparse principal component analysis and iterative thresholding
• Optimal detection of sparse principal components in high dimension
• High-dimensional analysis of semidefinite relaxations for sparse principal components
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Improved bounds for sparse recovery from subsampled random convolutions
• A flexible convex relaxation for phase retrieval
• Sparse power factorization: balancing peakiness and sample complexity
• Rapid, robust, and reliable blind deconvolution via nonconvex optimization
• Do semidefinite relaxations solve sparse PCA up to the information limit?
• Sparse PCA via Covariance Thresholding
• Generalized power method for sparse principal component analysis
• Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
• Phase Retrieval via Wirtinger Flow: Theory and Algorithms
• Blind Deconvolution Using Convex Programming
• Blind Recovery of Sparse Signals From Subsampled Convolution
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
• Self-calibration and biconvex compressive sensing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Blind Demixing and Deconvolution at Near-Optimal Rate
• 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
• Convolutional Phase Retrieval via Gradient Descent
• Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization
• Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness
• Regularized gradient descent: a non-convex recipe for fast joint blind deconvolution and demixing
• The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
• Optimal Injectivity Conditions for Bilinear Inverse Problems with Applications to Identifiability of Deconvolution Problems
• Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds
• Low-rank matrix completion using alternating minimization

This page was built for publication: Sparse power factorization: balancing peakiness and sample complexity