Learning a Gaussian mixture for sparsity regularization in inverse problems
From MaRDI portal
Cites work
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Compressed sensing
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Convergence Rates for Learning Linear Operators from Noisy Data
- Deep null space learning for inverse problems: convergence analysis and rates
- Dictionary Optimization for Block-Sparse Representations
- First-order methods in optimization
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- Hierachical Bayesian models and sparsity: \(\ell_2\)-magic
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Least angle regression. (With discussion)
- Model Selection and Estimation in Regression with Grouped Variables
- On the mathematical foundations of learning
- Optimal estimation of \(\ell_1\)-regularization prior from a regularized empirical Bayesian risk standpoint
- Probability-1
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Scikit-learn: machine learning in Python
- Sensitivity computation of the ℓ 1 minimization problem and its application to dictionary design of ill-posed problems
- Should Penalized Least Squares Regression be Interpreted as Maximum A Posteriori Estimation?
- Solving Inverse Problems With Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity
This page was built for publication: Learning a Gaussian mixture for sparsity regularization in inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7267108)
