The DOI matches its Crossref record; 212 of the 212 references it cites were found in a registry or an index.
Graphical Models, Exponential Families, and Variational Inference
Abstract
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building large-scale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fields, including bioinformatics, communication theory, statistical physics, combinatorial optimization, signal and image processing, information retrieval and statistical machine learning. Many problems that arise in specific instances-including the key problems of computing marginals and modes of probability distributions-are best studied in the general setting. Working with exponential family representations, and exploiting the conjugate duality between the cumulant function and the entropy for exponential families, Graphical Models, Exponential Families and Variational Inference develops general variational representations of the problems of computing likelihoods, marginal probabilities and most probable configurations. It describes how a wide variety of algorithms- among them sum-product, cluster variational methods, expectation-propagation, mean field methods, and max-product-can all be understood in terms of exact or approximate forms of these variational representations. The variational approach provides a complementary alternative to Markov chain Monte Carlo as a general source of approximation methods for inference in large-scale statistical models.
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
Items 201–212 of 212
Improved Dynamic Schedules for Belief PropagationPreprint
Sutton, C. A., & McCallum, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.5291 · Cited by 44
Belief Propagation on Partially Ordered Sets
McEliece, R. J., & Yıldırım, M. A. (2003) · The IMA volumes in mathematics and its applications · doi:10.1007/978-0-387-21696-6_10 · Cited by 42
Multitarget-multisensor data association using the tree-reweighted max-product algorithm
Chen, L., Wainwright, M. J., Çetin, M., & Willsky, A. S. (2003) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.496939 · Cited by 42
Self-citationSolving Markov Random Fields using Second Order Cone Programming Relaxations
Kumar, M., Torr, P. H. S., & Zisserman, A. (2006) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2006.283 · Cited by 37
Chertkov, M., & Chernyak, V. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0609154 · Cited by 35
Contingency Tables and Log-Linear Models: Basic Results and New Developments
Fienberg, S. E. (2000) · Journal of the American Statistical Association · doi:10.1080/01621459.2000.10474242 · Cited by 33
An Analysis of Convex Relaxations for MAP Estimation
Kumar, M., Kolmogorov, V., & Torr, P. H. S. (2007) · UCL Discovery (University College London) · Cited by 28
On Improving the Efficiency of the Iterative Proportional Fitting Procedure
Teh, Y. W., & Welling, M. (2003) · Cited by 25
A rigorous proof of the cavity method for counting matchingsPreprint
Bayati, M., & Nair, C. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cond-mat/0607290 · Cited by 24
Guessing Facets: Polytope Structure and Improved LP Decoder
Dimakis, A. G., & Wainwright, M. J. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.262070 · Cited by 24
Self-citationA Tighter Bound for Graphical Models
Leisink, M. A. R., & Kappen, H. J. (2001) · Neural Computation · doi:10.1162/089976601750399344 · Cited by 22
On Structured-Summary Propagation, LFSR Synchronization, and Low-Complexity Trellis Decoding
Dauwels, J., Loeliger, H., Merkli, P., & Ostojic, M. (2003) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 8
Cited by
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Blei, D. M. (2012) · Communications of the ACM · doi:10.1145/2133806.2133826 · Cited by 5,516
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Sparse and Compositionally Robust Inference of Microbial Ecological Networks
Kurtz, Z. D., Müller, C. L., Miraldi, E. R., Littman, D. R., Blaser, M. J., & Bonneau, R. A. (2015) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004226 · Cited by 1,799
Graph Signal Processing: Overview, Challenges, and Applications
Ortega, A., Frossard, P., Kovačević, J., Moura, J. M. F., & Vandergheynst, P. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2820126 · Cited by 1,787
Metadata
- Authors
- Wainwright, M. J., & Jordan, M. I.
- Venue
- now publishers, Inc. eBooks
- Publisher
- now Publishers Inc
- Published
- 2007
- OpenAlex
- W2120340025
- Cited by
- 2,959
- References
- 212
- FWCI
- 20.79
- Type
- book
- 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.