Sparse approximation based on a random overcomplete basis
From MaRDI portal
Publication:3302727
DOI10.1088/1742-5468/2016/06/063302zbMath1456.62014arXiv1510.02189OpenAlexW2340480839MaRDI QIDQ3302727
Tomoyuki Obuchi, Yoshiyuki Kabashima, Yoshinori Nakanishi-Ohno, Masato Okada
Publication date: 11 August 2020
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.02189
Analysis of algorithms (68W40) Computational methods for problems pertaining to probability theory (60-08) Statistical aspects of information-theoretic topics (62B10)
Related Items (2)
Evaluation of generalized degrees of freedom for sparse estimation by replica method ⋮ Approximate message passing for nonconvex sparse regularization with stability and asymptotic analysis
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Low rank approximation. Algorithms, implementation, applications
- The best \(m\)-term approximation and greedy algorithms
- Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries
- Nonlinear methods of approximation
- Weak greedy algorithms
- Introduction to the Replica Theory of Disordered Statistical Systems
- Compressed sensing and best 𝑘-term approximation
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Statistical Physics of Spin Glasses and Information Processing
- Sparse Approximate Solutions to Linear Systems
- Blind Compressed Sensing
- Compressed sensing
- Adaptive greedy approximations
This page was built for publication: Sparse approximation based on a random overcomplete basis
