The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
On Variational Message Passing on Factor Graphs
Abstract
In this paper, it is shown how (naive and structured) variational algorithms may be derived from a factor graph by mechanically applying generic message computation rules; in this way, one can bypass error-prone variational calculus. In prior work by Bishop et al., Xing et al., and Geiger, directed and undirected graphical models have been used for this purpose. The factor graph notation amounts to simpler generic variational message computation rules; by means of factor graphs, variational methods can straightforwardly be compared to and combined with various other message-passing inference algorithms, e.g., Kalman filters and smoothers, iterated conditional modes, expectation maximization (EM), gradient methods, and particle filters. Some of those combinations have been explored in the literature, others seem to be new. Generic message computation rules for such combinations are formulated.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 2×
“The messages (57) are then updated according to the standard schedule for cycle-free graphs [51].”
MethodAn Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187
(2005) · Edinburgh Research Explorer (University of Edinburgh) · doi:10.5555/1046920.1088695 · Cited by 650
Research works printed but not linked: 22
- 10.1109/MSP.2004.1267047 · DOI · Paper page
- 10.1109/ICC.2004.1313034 · doi:10.1109/icc.2004.1313034
- 10.1109/MSP.2004.1267055 · doi:10.1109/msp.2004.1267055
- dauwels, 2005, On graphical models for communications and machine learning Algorithms bounds and analog implementation
- dauwels, 2005, Steepest Descent on Factor Graphs, Proc IEEE Information Theory Workshop, 42
- dempster, 1977, Maximum Likelihood From Incomplete Data via the EM Algorithm, Journal of the Royal Statistical Society B, 39, 1, 10.1111/j.2517-6161.1977.tb01600.x · DOI · Paper page
- eckford, 2000, Iterative Multiuser Detection with Graphical Mod-eling, IEEE International Conference on Personal Wireless Communications
- 10.1109/ISIT.2005.1523402 · DOI
- ghahramani, 2000, Graphical Models and Variational Methods, AdvancedMean Field methods-Theory and Practice
- 10.1109/ISIT.2006.261910 · doi:10.1109/isit.2006.261910
- beal, 2003, Variational algorithms for approximate Bayesian inference
- winn, 2003, Variational Message Passing and Its Applications
- bishop, 2006, Pattern Recognition and Machine Learning (Chapter 10)
- bishop, 2003, Structured Variational Distributions in VIBES, Proc Artifi cialIntelligenceand Statistics Key West
- 10.1109/18.910573 · DOI · Paper page
- 10.1063/1.2811677 · DOI · Paper page
- mclachlan, 1997, The EMAlgorithm and Extensions Wiley
- geiger, 2005, Structured Variational Inference Procedures and their Realizations, Proc Tenth International Workshop on Anificialintelligence and Statistics Barbados
- de freitas, 2001, Variational MCMC, Proc 17th Uncertainty inAnificialintelligence (UAI)
- xing, 2003, A Generalized Mean Field Algorithm for Variational Inference in Exponential Families, Proc Uncertainty Artificial Intelligence, 583
- 10.1007/978-1-4757-3437-9 · DOI · Paper page
- beal, 2003, The Variational Kalman Smoprint, Gatsby Unit Technical Report TROI-003, 1
Cited by
The graphical brain: Belief propagation and active inference
Friston, K. J., Parr, T., & de Vries, B. (2017) · Network Neuroscience · doi:10.1162/netn_a_00018 · Cited by 415
“…and variational message passing (i.e., variational filter-ing) are formally identical, because the messages in belief propagation are the same as those required from the Markov blanket of each random variable in the corresponding Bayesian network (Beal, 2003; Dauwels, 2007; Friston, 2008).”
BackgroundLiu, Y., Tan, Z., Hu, H., Cimini, L. J., & Li, G. Y. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2320074 · Cited by 394
Answering Schrödinger's question: A free-energy formulation
Ramstead, M. J. D., Badcock, P. B., & Friston, K. J. (2018) · Physics of Life Reviews · doi:10.1016/j.plrev.2017.09.001 · Cited by 354
A step-by-step tutorial on active inference and its application to empirical data
Smith, R., Friston, K. J., & Whyte, C. J. (2022) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2021.102632 · Cited by 246
Generalised free energy and active inference
Parr, T., & Friston, K. J. (2019) · Biological Cybernetics · doi:10.1007/s00422-019-00805-w · Cited by 236
“Discrete state-space models can be inferred using belief propagation (Yedidia et al. 2005) or variational message passing (Dauwels 2007; Winn 2004) schemes that have a degree of neuronal plausibility (Friston et al. 2017c).”
BackgroundMethodInfluentialActive inference on discrete state-spaces: A synthesis
Da Costa, L., Parr, T., Sajid, N., Veselic, S., Neacsu, V., & Friston, K. (2020) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2020.102447 · Cited by 226
“The neuronal dynamics for state estimation coincide with variational message passing [129, 130]: a widely used algorithm for approximate Bayesian inference.”
MethodA free energy principle for a particular physics
Friston, K. (2019) · arXiv · doi:10.48550/arxiv.1906.10184 · Cited by 222
Sentience and the Origins of Consciousness: From Cartesian Duality to Markovian Monism
Friston, K. J., Wiese, W., & Hobson, J. A. (2020) · Entropy · doi:10.3390/e22050516 · Cited by 186
The free energy principle made simpler but not too simple
Friston, K., Da Costa, L., Sajid, N., Heins, C., Ueltzhöffer, K., Pavliotis, G. A., & Parr, T. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.07.001 · Cited by 163
“From the perspective of Bayesian inference, this takes us from (computationally costly) exact Bayesian inference to (computationally cheap) approximate Bayesian inference [48,49,104].”
Inferring neural activity before plasticity as a foundation for learning beyond backpropagation
Song, Y., Millidge, B., Salvatori, T., Lukasiewicz, T., Xu, Z., & Bogacz, R. (2024) · Nature Neuroscience · doi:10.1038/s41593-023-01514-1 · Cited by 85
Generative models for active vision
Parr, T., Sajid, N., Da Costa, L., Mirza, M. B., & Friston, K. J. (2021) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2021.651432 · Cited by 46
Neural dynamics under active inference: plausibility and efficiency of information processing
Da Costa, L., Parr, T., Sengupta, B., & Friston, K. (2021) · Entropy · doi:10.3390/e23040454 · Cited by 38
Federated inference and belief sharing
Friston, K. J., Parr, T., Heins, C., Constant, A., Friedman, D., Isomura, T., Fields, C., Verbelen, T., Ramstead, M., Clippinger, J., et al. (2024) · Neuroscience & Biobehavioral Reviews · doi:10.1016/j.neubiorev.2023.105500 · Cited by 30
Metadata
- Authors
- Dauwels, J.
- Venue
- 2007 IEEE International Symposium on Information Theory
- Publisher
- IEEE
- Published
- 2007-06
- Pages
- 2546-2550
- OpenAlex
- W2091990110
- Cited by
- 174
- References
- 4
- FWCI
- 0.87
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.