Analysis of random sequential message passing algorithms for approximate inference

DOI10.1088/1742-5468/ac764aOpenAlexW4283807454MaRDI QIDQ5101073

No author found.

Publication date: 2 September 2022

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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

zbMATH Keywords

analysis of algorithmsstatistical inferencemachine learningmessage-passing algorithms

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model
• Generating Functional Analysis for Iterative CDMA Multiuser Detectors
• A theory of solving TAP equations for Ising models with general invariant random matrices
• Mean-field equations for spin models with orthogonal interaction matrices
• New method for studying the dynamics of disordered spin systems without finite-size effects
• Approximate survey propagation for statistical inference
• Analysis of Bayesian inference algorithms by the dynamical functional approach
• Vector Approximate Message Passing
• 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
• A CDMA multiuser detection algorithm on the basis of belief propagation
• A dynamical mean-field theory for learning in restricted Boltzmann machines

This page was built for publication: Analysis of random sequential message passing algorithms for approximate inference