A common network architecture efficiently implements a variety of sparsity-based inference problems
From MaRDI portal
Publication:2840897
Recommendations
- A network of spiking neurons for computing sparse representations in an energy-efficient way
- Learning and Inference in Sparse Coding Models With Langevin Dynamics
- Belief Propagation in Networks of Spiking Neurons
- A sparse coding model based on structural similarity
- Deep Learning as Sparsity-Enforcing Algorithms
Cites work
- scientific article; zbMATH DE number 5284813 (Why is no real title available?)
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Internal representations for associative memory
- Local Strong Homogeneity of a Regularized Estimator
- Neural networks and physical systems with emergent collective computational abilities
- Regularization of Wavelet Approximations
- Robust regression: Asymptotics, conjectures and Monte Carlo
- The Adaptive Lasso and Its Oracle Properties
- Wavelet-based image estimation: an empirical Bayes approach using Jeffrey's noninformative prior
Cited in
(1)
This page was built for publication: A common network architecture efficiently implements a variety of sparsity-based inference problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840897)
