Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 174

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

Dauwels, Justin·2007·2007 IEEE International Symposium on Information Theory

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/isit.2007.4557602

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 4 references

Research works printed but not linked: 22

  1. 10.1109/MSP.2004.1267047 · DOI · Paper page
  2. 10.1109/ICC.2004.1313034 · doi:10.1109/icc.2004.1313034
  3. 10.1109/MSP.2004.1267055 · doi:10.1109/msp.2004.1267055
  4. dauwels, 2005, On graphical models for communications and machine learning Algorithms bounds and analog implementation
  5. dauwels, 2005, Steepest Descent on Factor Graphs, Proc IEEE Information Theory Workshop, 42
  6. 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
  7. eckford, 2000, Iterative Multiuser Detection with Graphical Mod-eling, IEEE International Conference on Personal Wireless Communications
  8. 10.1109/ISIT.2005.1523402 · DOI
  9. ghahramani, 2000, Graphical Models and Variational Methods, AdvancedMean Field methods-Theory and Practice
  10. 10.1109/ISIT.2006.261910 · doi:10.1109/isit.2006.261910
  11. beal, 2003, Variational algorithms for approximate Bayesian inference
  12. winn, 2003, Variational Message Passing and Its Applications
  13. bishop, 2006, Pattern Recognition and Machine Learning (Chapter 10)
  14. bishop, 2003, Structured Variational Distributions in VIBES, Proc Artifi cialIntelligenceand Statistics Key West
  15. 10.1109/18.910573 · DOI · Paper page
  16. 10.1063/1.2811677 · DOI · Paper page
  17. mclachlan, 1997, The EMAlgorithm and Extensions Wiley
  18. geiger, 2005, Structured Variational Inference Procedures and their Realizations, Proc Tenth International Workshop on Anificialintelligence and Statistics Barbados
  19. de freitas, 2001, Variational MCMC, Proc 17th Uncertainty inAnificialintelligence (UAI)
  20. xing, 2003, A Generalized Mean Field Algorithm for Variational Inference in Exponential Families, Proc Uncertainty Artificial Intelligence, 583
  21. 10.1007/978-1-4757-3437-9 · DOI · Paper page
  22. beal, 2003, The Variational Kalman Smoprint, Gatsby Unit Technical Report TROI-003, 1

Cited by

See all 174

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: On Variational Message Passing on Factor Graphs. https://app.cochat.ai/papers/10.1109/isit.2007.4557602
The paper
Dauwels, J. (2007). On Variational Message Passing on Factor Graphs. 2007 IEEE International Symposium on Information Theory. https://doi.org/10.1109/isit.2007.4557602

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.