Analysis of random sequential message passing algorithms for approximate inference
From MaRDI portal
Publication:5101073
Recommendations
- Analysis of Bayesian inference algorithms by the dynamical functional approach
- High-temperature expansions and message passing algorithms
- Approximate survey propagation for statistical inference
- Universality of approximate message passing algorithms
- A dynamical mean-field theory for learning in restricted Boltzmann machines
Cites work
- A CDMA multiuser detection algorithm on the basis of belief propagation
- A dynamical mean-field theory for learning in restricted Boltzmann machines
- A theory of solving TAP equations for Ising models with general invariant random matrices
- An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
- Analysis of Bayesian inference algorithms by the dynamical functional approach
- Approximate survey propagation for statistical inference
- Gaussian processes for machine learning.
- Generating Functional Analysis for Iterative CDMA Multiuser Detectors
- scientific article; zbMATH DE number 5943539 (Why is no real title available?)
- Mean-field equations for spin models with orthogonal interaction matrices
- New method for studying the dynamics of disordered spin systems without finite-size effects
- Rigorous Dynamics of Expectation-Propagation-Based Signal Recovery from Unitarily Invariant Measurements
- The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
- Vector Approximate Message Passing
Cited in
(3)
This page was built for publication: Analysis of random sequential message passing algorithms for approximate inference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101073)