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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
(1988) · Cited by 16,582
Evolutionary trees from DNA sequences: A maximum likelihood approach.
Felsenstein, J. (1981) · Journal of Molecular Evolution · doi:10.1007/bf01734359 · Cited by 14,571
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
Krogh, A., Larsson, B., von Heijne, G., & Sonnhammer, E. L. L. (2001) · Journal of Molecular Biology · doi:10.1006/jmbi.2000.4315 · Cited by 12,654
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Foundations of statistical natural language processing
Manning, C. D., & Schütze, H. (1999) · Cited by 9,816
Hapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Markov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
Fundamentals of speech recognition
Rabiner, L. R., & Juang, B.-H. F. (1993) · Cited by 7,680
Sampling-based approaches to calculating marginal densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10476213 · Cited by 6,606
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Spatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067
Stanley, R. P., & Rota, G.-C. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9780511805967 · Cited by 6,025
Forney, G. D. (1973) · Proceedings of the IEEE · doi:10.1109/proc.1973.9030 · Cited by 5,647
Exactly Solved Models in Statistical Mechanics
Baxter, R. J. (1985) · Series on Advances in Statistical Mechanics · doi:10.1142/9789814415255_0002 · Cited by 5,611
Theory of Linear and Integer Programming
Letchford, A. N., & Schrijver, A. (2000) · The Journal of the Operational Research Society · doi:10.2307/253980 · Cited by 5,515
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
Combinatorial optimization. Polyhedra and efficiency.
Schrijver, A. (2003) · UvA-DARE (University of Amsterdam) · Cited by 4,637
On the Statistical Analysis of Dirty Pictures
Besag, J. (1986) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1986.tb01412.x · Cited by 4,191
Vandenberghe, L., & Boyd, S. (1996) · SIAM Review · doi:10.1137/1038003 · Cited by 4,105
Lauritzen, S. L., & Spiegelhalter, D. J. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01721.x · Cited by 3,902
An 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
Self-citationBollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Geometric Algorithms and Combinatorial Optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1988) · Algorithms and Combinatorics · doi:10.1007/978-3-642-97881-4 · Cited by 3,431
Stochastic models, estimation, and control
(1982) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6186-7 · Cited by 3,229
(2011) · SpringerReference · doi:10.1007/springerreference_57547 · Cited by 3,190
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
Ripley, B. D. (1981) · Cited by 2,819
Introduction to linear optimization
Bertsimas, D., & Tsitsiklis, J. N. (1997) · Cited by 2,705
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
Reducibility Among Combinatorial Problems
Karp, R. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_8 · Cited by 2,490
Global Optimization with Polynomials and the Problem of Moments
Lasserre, J. B. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623400366802 · Cited by 2,474
Convex Analysis and Minimization Algorithms I
Hiriart-Urruty, J.-B., & Lemaréchal, C. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02796-7 · Cited by 2,378
Ziegler, G. M. (1995) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-8431-1 · Cited by 2,329
Richardson, T., & Urbanke, R. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511791338 · Cited by 2,271
Methods of Information Geometry
Amari, S.-I., & Nagaoka, H. (2007) · Translations of Mathematical Monographs · doi:10.1090/mmono/191 · Cited by 2,204
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
Applied numerical linear algebra
(1998) · Choice Reviews Online · doi:10.5860/choice.35-3919 · Cited by 2,170
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Ripley, B. D. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725218 · Cited by 2,052
Introduction to Modern Statistical Mechanics
Chandler, D., & Percus, J. K. (1988) · Physics Today · doi:10.1063/1.2811680 · Cited by 1,954
A Theory of Cooperative Phenomena
Kikuchi, R. (1951) · Physical Review · doi:10.1103/physrev.81.988 · Cited by 1,942
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Mathematical Statistics: Basic Ideas and Selected Topics.
Wachter, K. W., Bickel, P. J., & Doksum, K. A. (1979) · Journal of the American Statistical Association · doi:10.2307/2286373 · Cited by 1,886
(2003) · Cited by 1,680
Gibbs Measures and Phase Transitions
Georgii, H.-O. (2011) · De Gruyter eBooks · doi:10.1515/9783110250329 · Cited by 1,674
Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850085 · Cited by 1,617
Statistical Analysis of Non-Lattice Data
Besag, J. (1975) · The Statistician · doi:10.2307/2987782 · Cited by 1,559
Semidefinite programming relaxations for semialgebraic problems
Parrilo, P. A. (2003) · Mathematical Programming · doi:10.1007/s10107-003-0387-5 · Cited by 1,527
On the inherent intractability of certain coding problems (Corresp.)
Berlekamp, E., McEliece, R., & van Tilborg, H. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055873 · Cited by 1,523
Dechter, R. (2003) · Cited by 1,518
Freeman, W. T., Pasztor, E. C., & Carmichael, O. T. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026501619075 · Cited by 1,459
Variational inference for Dirichlet process mixtures
Blei, D. M., & Jordan, M. I. (2006) · Bayesian Analysis · doi:10.1214/06-ba104 · Cited by 1,438
Self-citationMarkov Random Field Texture Models
Cross, G. R., & Jain, A. K. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767341 · Cited by 1,414
Fundamentals of Convex Analysis
Hiriart-Urruty, J.-B., & Lemaréchal, C. (2001) · Springer eBooks · doi:10.1007/978-3-642-56468-0 · Cited by 1,402
Expectation Propagation for approximate Bayesian inference
Minka, T. P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2294 · Cited by 1,392
Shukla, S., Mishra, B., Avashthi, H., & Chandra, M. (2022) · Bioinformatics · doi:10.1016/b978-0-323-89775-4.00003-1 · Cited by 1,244
Tchebycheff Systems: With Applications in Analysis and Statistics
Kappos, D. A., Karlin, S., & Studden, W. J. (1967) · Revue de l Institut International de Statistique / Review of the International Statistical Institute · doi:10.2307/1401807 · Cited by 1,239
Banerjee, O., Ghaoui, L. E., & d’Aspremont, A. (2007) · arXiv (Cornell University) · doi:10.1145/1390681.1390696 · Cited by 1,233
The Classical Moment Problem and Some Related Questions in Analysis
Akhiezer, N. I. (2020) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611976397 · Cited by 1,208
Generalized Iterative Scaling for Log-Linear Models
Darroch, J. N., & Ratcliff, D. (1972) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177692379 · Cited by 1,206
Dynamic Programming and Stochastic Control
Bertsekas, D. P., & White, C. C. (1977) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1977.4309612 · Cited by 1,199
Factorial Hidden Markov Models
Ghahramani, Z., & Jordan, M. I. (1997) · Machine Learning · doi:10.1023/a:1007425814087 · Cited by 1,157
Self-citationConvergent Tree-Reweighted Message Passing for Energy Minimization
Kolmogorov, V. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.200 · Cited by 1,095
Analytic and Algorithmic Solution of Random Satisfiability Problems
Mézard, M., Parisi, G., & Zecchina, R. (2002) · Science · doi:10.1126/science.1073287 · Cited by 1,071
Exact Maximum A Posteriori Estimation for Binary Images
Greig, D. M., Porteous, B. T., & Seheult, A. H. (1989) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1989.tb01764.x · Cited by 1,055
(2016) · Biostatistics in Public Health Using STATA · doi:10.1201/b19547-8 · Cited by 1,037
Cones of Matrices and Set-Functions and 0–1 Optimization
Lovász, L., & Schrijver, A. (1991) · SIAM Journal on Optimization · doi:10.1137/0801013 · Cited by 1,008
Monte Carlo Statistical Methods (Springer Texts in Statistics)
Robert, C. P., & Casella, G. (2005) · Springer eBooks · Cited by 1,002
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70844 · Cited by 966
Submodular functions and convexity
Lovász, L. (1983) · Mathematical Programming The State of the Art · doi:10.1007/978-3-642-68874-4_10 · Cited by 964
Dimer Statistics and Phase Transitions
Kasteleyn, P. W. (1963) · Journal of Mathematical Physics · doi:10.1063/1.1703953 · Cited by 946
Sherali, H. D., & Adams, W. P. (1990) · SIAM Journal on Discrete Mathematics · doi:10.1137/0403036 · Cited by 931
Generalized Belief Propagation
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2000) · Cited by 918
An Introduction to factor graphs
Loeliger, H. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1267047 · Cited by 905
Turbo decoding as an instance of Pearl's "belief propagation" algorithm
McEliece, R. J., MacKay, D. J. C., & Cheng, J.-F. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661103 · Cited by 904
The Theory of Graphs and Its Applications
Burger, E., Berge, C., & Doig, A. (1965) · Econometrica · doi:10.2307/1911908 · Cited by 897
A family of algorithms for approximate bayesian inference
Minka, T. P., & Picard, R. W. (2001) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 882
(2018) · Physics Subject Headings (PhySH) · doi:10.29172/0660b3fe-654b-49c9-a7fa-79f18efe2aa0 · Cited by 882
Codes and Decoding on General Graphs
Wiberg, N. (1996) · Cited by 869
Matroids and the greedy algorithm
Edmonds, J. (1971) · Mathematical Programming · doi:10.1007/bf01584082 · Cited by 866
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
Parallel optimization: Theory, algorithms, and applications
(1998) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(98)90713-1 · Cited by 813
(2024) · On Bilinguals and Bilingualism · doi:10.1017/9781009210409.006 · Cited by 800
The generalized distributive law
Aji, S. M., & McEliece, R. J. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825794 · Cited by 735
MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
Wainwright, M. J., Jaakkola, T. S., & Willsky, A. S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.856938 · Cited by 654
Self-citationDeterminant Maximization with Linear Matrix Inequality Constraints
Vandenberghe, L., Boyd, S., & Wu, S.-P. (1998) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896303430 · Cited by 652
Bollobás, B. (1979) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-9967-7 · Cited by 610
Computational Molecular Biology: An Algorithmic Approach
Pevzner, P. A. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/2022.001.0001 · Cited by 605
Finding the genes in genomic DNA
Burge, C. B., & Karlin, S. (1998) · Current Opinion in Structural Biology · doi:10.1016/s0959-440x(98)80069-9 · Cited by 597
Markov fields on finite graphs and lattices
Hammersley, J. M., & Clifford, P. (1971) · Cited by 579
Information geometry and alternating minimization procedures
Csiszár, I. (1984) · Statistics & Risk Modeling · Cited by 579
Using Linear Programming to Decode Binary Linear Codes
Feldman, J., Wainwright, M. J., & Karger, D. R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.842696 · Cited by 572
Self-citationCorrectness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology
Weiss, Y., & Freeman, W. T. (2001) · Neural Computation · doi:10.1162/089976601750541769 · Cited by 560
Spatial Statistics and Bayesian Computation
Besag, J., & Green, P. J. (1993) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1993.tb01467.x · Cited by 542
Tractable Inference for Complex Stochastic Processes
Boyen, X., & Koller, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7362 · Cited by 471
Correctness of Local Probability Propagation in Graphical Models with Loops
Weiss, Y. (2000) · Neural Computation · doi:10.1162/089976600300015880 · Cited by 452
RandomK-satisfiability problem: From an analytic solution to an efficient algorithm
Mézard, M., & Zecchina, R. (2002) · Physical Review E · doi:10.1103/physreve.66.056126 · Cited by 448
Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models
Lauritzen, S. L. (1992) · Journal of the American Statistical Association · doi:10.1080/01621459.1992.10476265 · Cited by 436
Information and Exponential Families: In Statistical Theory
Barndorff-Nielsen, O. E. (2014) · Wiley series in probability and statistics · doi:10.1002/9781118857281 · Cited by 434
Survey propagation: An algorithm for satisfiability
Braunstein, A., Mézard, M., & Zecchina, R. (2005) · Random Structures & Algorithms · doi:10.1002/rsa.20057 · Cited by 433
(1998) · Asymptotic Statistics · doi:10.1017/cbo9780511802256.013 · Cited by 421
Kleinberg, J., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/585265.585268 · Cited by 400
Fundamentals of Statistical Exponential Families
Brown, L. D. (1987) · Cited by 393
Iterative decoding of compound codes by probability propagation in graphical models
Kschischang, F. R., & Frey, B. J. (1998) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.661110 · Cited by 388
A Comparative Study of Energy Minimization Methods for Markov Random Fields
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744047_2 · Cited by 386
A New Class of Upper Bounds on the Log Partition Function
Wainwright, M. J., Jaakkola, T. S., & Willsky, A. S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850091 · Cited by 381
Self-citationDifferential Geometry of Curved Exponential Families-Curvatures and Information Loss
Amari, S.-I. (1982) · The Annals of Statistics · doi:10.1214/aos/1176345779 · Cited by 373
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Laurent, M. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.3.470.16391 · Cited by 373
The boolean quadric polytope: Some characteristics, facets and relatives
Padberg, M. W. (1989) · Mathematical Programming · doi:10.1007/bf01589101 · Cited by 356
On the Dimer Solution of Planar Ising Models
Fisher, M. E. (1966) · Journal of Mathematical Physics · doi:10.1063/1.1704825 · Cited by 347
First-Order Methods for Sparse Covariance Selection
d'Aspremont, A., Banerjee, O., & El Ghaoui, L. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060670985 · Cited by 343
A Linear Programming Approach to Max-Sum Problem: A Review
Werner, T. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1036 · Cited by 342
(1972) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6010-2 · Cited by 341
Convergence condition of the TAP equation for the infinite-ranged Ising spin glass model
Plefka, T. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/6/035 · Cited by 327
Roof duality, complementation and persistency in quadratic 0–1 optimization
Hammer, P. L., Hansen, P., & Simeone, B. (1984) · Mathematical Programming · doi:10.1007/bf02612354 · Cited by 316
Codes and iterative decoding on general graphs
Wiberg, N., Loeliger, H., & Kotter, R. (1995) · European Transactions on Telecommunications · doi:10.1002/ett.4460060507 · Cited by 314
Multiresolution Markov models for signal and image processing
Willsky, A. S. (2002) · Proceedings of the IEEE · doi:10.1109/jproc.2002.800717 · Cited by 305
Loopy Belief Propagation: Convergence and Effects of Message Errors
Ihler, A., Fischer, J. W., & Willsky, A. S. (2005) · doi:10.5555/1046920.1088703 · Cited by 286
Propagation Algorithms for Variational Bayesian Learning
Ghahramani, Z., & Beal, M. J. (2000) · Cited by 283
Expectation Consistent Approximate Inference
Opper, M., & Winther, O. (2005) · Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU) · doi:10.5555/1046920.1194917 · Cited by 279
Bayesian Inference and Optimal Design for the Sparse Linear Model
Seeger, M. (2008) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5555/1390681.1390707 · Cited by 277
Gaussian Markov Distributions over Finite Graphs
Speed, T. P., & Kiiveri, H. T. (1986) · The Annals of Statistics · doi:10.1214/aos/1176349846 · Cited by 273
Tutorial on Variational Approximation Methods
Jaakkola, T. S. (2001) · Advanced Mean Field Methods · doi:10.7551/mitpress/1100.003.0014 · Cited by 269
MRF Optimization via Dual Decomposition: Message-Passing Revisited
Komodakis, N., Paragios, N., & Tziritas, G. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408890 · Cited by 256
Combining Phylogenetic and Hidden Markov Models in Biosequence Analysis
Siepel, A., & Haussler, D. (2004) · Journal of Computational Biology · doi:10.1089/1066527041410472 · Cited by 253
The Geometry of Exponential Families
Efron, B. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344130 · Cited by 246
Applications of a general propagation algorithm for probabilistic expert systems
Dawid, A. P. (1992) · Statistics and Computing · doi:10.1007/bf01890546 · Cited by 239
Tree-based reparameterization framework for analysis of sum-product and related algorithms
Wainwright, M. J., Jaakkola, T. S., & Willsky, A. S. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.810642 · Cited by 232
Self-citationYuille, A. L. (2002) · Neural Computation · doi:10.1162/08997660260028674 · Cited by 227
Residual Belief Propagation: Informed Scheduling for Asynchronous Message Passing
Elidan, G., McGraw, I., & Koller, D. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.6837 · Cited by 225
Grimmett, G. R. (1973) · Bulletin of the London Mathematical Society · doi:10.1112/blms/5.1.81 · Cited by 212
Gaussian Processes for Classification: Mean-Field Algorithms
Opper, M., & Winther, O. (2000) · Neural Computation · doi:10.1162/089976600300014881 · Cited by 209
Distributed fusion in sensor networks
Cetin, M., Chen, L., Fisher, J. W., Ihler, A. T., Moses, R. L., Wainwright, M. J., & Willsky, A. S. (2006) · IEEE Signal Processing Magazine · doi:10.1109/msp.2006.1657816 · Cited by 204
Self-citationExploiting Tractable Substructures in Intractable Networks
Saul, L. K., & Jordan, M. I. (1995) · Cited by 203
Self-citationDudı́k, M., Phillips, S. J., & Schapire, R. E. (2007) · Journal of Machine Learning Research · doi:10.5555/1314498.1314540 · Cited by 200
Efficient Learning in Boltzmann Machines Using Linear Response Theory
Kappen, H. J., & Rodríguez, F. B. (1998) · Neural Computation · doi:10.1162/089976698300017386 · Cited by 188
Loopy belief propagation and Gibbs measures
Tatikonda, S., & Jordan, M. I. (2002) · Cited by 181
Self-citationThe use of Markov Random Fields as models of texture
Hassner, M., & Sklansky, J. (1980) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(80)90019-2 · Cited by 173
Wainwright, M. J., Jaakkola, T., & Willsky, A. S. (2003) · Cited by 167
Self-citationLoop series for discrete statistical models on graphs
Chertkov, M., & Chernyak, V. (2006) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2006/06/p06009 · Cited by 155
Linear Programming Relaxations and Belief Propagation -- An Empirical Study
Yanover, C., Meltzer, T., & Weiss, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248615 · Cited by 153
A new look at survey propagation and its generalizations
Maneva, E., Mossel, E., & Wainwright, M. J. (2007) · Journal of the ACM · doi:10.1145/1255443.1255445 · Cited by 149
Self-citationOn the Uniqueness of Loopy Belief Propagation Fixed Points
Heskes, T. (2004) · Neural Computation · doi:10.1162/0899766041941943 · Cited by 146
Piecewise Training for Undirected ModelsPreprint
Sutton, C. A., & McCallum, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1409 · Cited by 145
Expectation Propagation for Exponential Families
Seeger, M. (2005) · Cited by 131
Tree consistency and bounds on the performance of the max-product algorithm and its generalizations
Wainwright, M. J., Jaakkola, T., & Willsky, A. S. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000021412.33763.d5 · Cited by 125
Self-citationVariational Probabilistic Inference and the QMR-DT Network
Jaakkola, T., & Jordan, M. I. (1999) · Cited by 125
Self-citationSecond order cone programming relaxation of nonconvex quadratic optimization problems
Kim, S., & Kojima, M. (2001) · Optimization methods & software · doi:10.1080/10556780108805819 · Cited by 123
MAP Estimation, Linear Programming and Belief Propagation with Convex Free EnergiesPreprint
Weiss, Y., Yanover, C., & Meltzer, T. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.5286 · Cited by 120
Estimating the Wrong Graphical Model: Benefits in the Computation-Limited Setting
Wainwright, M. J. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248613 · Cited by 119
Self-citationMultilocus linkage analysis by blocked Gibbs sampling
Thomas, A., Gutin, A., Abkevich, V., & Bansal, A. T. (2000) · Statistics and Computing · doi:10.1023/a:1008947712763 · Cited by 113
Towards Low-Complexity Linear-Programming DecodingPreprint
Vontobel, P. O., & Koetter, R. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0602088 · Cited by 110
Meltzer, T., Yanover, C., & Weiss, Y. (2005) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2005.110 · Cited by 109
LP Decoding Corrects a Constant Fraction of Errors
Feldman, J., Malkin, T., Servedio, R. A., Stein, C., & Wainwright, M. J. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.887523 · Cited by 107
Self-citationLearning Markov networks: maximum bounded tree-width graphs
Karger, D. R., & Srebro, N. (2001) · doi:10.5555/365411.365486 · Cited by 104
Improving the Mean Field Approximation Via the Use of Mixture Distributions
Jaakkola, T., & Jordan, M. I. (1998) · Springer eBooks · doi:10.1007/978-94-011-5014-9_6 · Cited by 104
Self-citationGene finding with a hidden Markov model of genome structure and evolution
Pedersen, J. S., & Hein, J. (2003) · Bioinformatics · doi:10.1093/bioinformatics/19.2.219 · Cited by 104
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Ravikumar, P., & Lafferty, J. (2006) · International Conference on Machine Learning · doi:10.1145/1143844.1143937 · Cited by 103
Maximum weight matching via max-product belief propagation
Bayati, M., Shah, D., & Sharma, M. (2005) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2005.1523648 · Cited by 99
Belief Optimization for Binary Networks: A Stable Alternative to Loopy Belief PropagationPreprint
Welling, M., & Teh, Y. W. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2317 · Cited by 98
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
Chekuri, C., Khanna, S., Naor, J. S., & Zosin, L. (2004) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480101396937 · Cited by 98
Loopy Belief Propagation for Bipartite Maximum Weight b-Matching
Huang, B., & Jebara, T. (2007) · Cited by 93
Approximate Inference and Constrained OptimizationPreprint
Heskes, T., Albers, K., & Kappen, B. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.2480 · Cited by 87
Opper, M., & Winther, O. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3695 · Cited by 87
Lectures on Contingency Tables
Lauritzen, S. L. (2002) · Cited by 86
Log-determinant relaxation for approximate inference in discrete Markov random fields
Wainwright, M. J., & Jordan, M. I. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.874409 · Cited by 85
Self-citationSignal-space characterization of iterative decoding
Frey, B. J., Koetter, R., & Vardy, A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910587 · Cited by 83
A Geometric Interpretation of Darroch and Ratcliff's Generalized Iterative Scaling
Csiszár, I. (1989) · The Annals of Statistics · doi:10.1214/aos/1176347279 · Cited by 81
Embedded Trees: Estimation of Gaussian Processes on Graphs with Cycles
Sudderth, E. B., Wainwright, M. J., & Willsky, A. S. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.836539 · Cited by 81
Self-citationKochman'ski, M. S. (2008) · Cited by 80
Minimizing and Learning Energy Functions for Side-Chain Prediction
Yanover, C., Schueler‐Furman, O., & Weiss, Y. (2008) · Journal of Computational Biology · doi:10.1089/cmb.2007.0158 · Cited by 78
Convexity Arguments for Efficient Minimization of the Bethe and Kikuchi Free Energies
Heskes, T. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1933 · Cited by 76
Probabilistic Analysis of Linear Programming Decoding
Daskalakis, C., Dimakis, A. G., Karp, R. M., & Wainwright, M. J. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.926452 · Cited by 76
Self-citationBayati, M., Borgs, C., Chayes, J., & Zecchina, R. (2011) · SIAM Journal on Discrete Mathematics · doi:10.1137/090753115 · Cited by 73
Lagrangian Relaxation for MAP Estimation in Graphical ModelsPreprint
Johnson, J. K., Malioutov, D., & Willsky, A. S. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.0013 · Cited by 72
Wiegerinck, W., & Heskes, T. (2002) · Cited by 69
Boltzmann Chains and Hidden Markov Models
Saul, L. K., & Jordan, M. I. (1994) · Cited by 68
Self-citationAn Idiosyncratic Journey Beyond Mean Field Theory
Yedidia, J. S. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/1100.003.0007 · Cited by 63
Loop Series and Bethe Variational Bounds in Attractive Graphical Models
Willsky, A. S., Sudderth, E. B., & Wainwright, M. J. (2007) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 57
Self-citationVery Loopy Probability Propagation for Unwrapping Phase Images
Frey, B. J., Koetter, R., & Petrović, N. (2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.003.0099 · Cited by 57
Upper-bounds for quadratic 0–1 maximization
Boros, E., Crama, Y., & Hammer, P. L. (1990) · Operations Research Letters · doi:10.1016/0167-6377(90)90044-6 · Cited by 56
Linear programming analysis of loopy belief propagation for weighted matching
Sanghavi, S., Malioutov, D., & Willsky, A. S. (2007) · Cited by 55
Multiple-sequence functional annotation and the generalized hidden Markov phylogeny
McAuliffe, J., Pachter, L. S., & Jordan, M. I. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth153 · Cited by 50
Self-citationMinka, T. (2004) · Cited by 49
Convergence Analysis of Reweighted Sum-Product Algorithms
Roosta, T. G., Wainwright, M. J., & Sastry, S. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.924136 · Cited by 47
Self-citationConvergent Message-Passing Algorithms for Inference over General Graphs with Convex Free EnergiesPreprint
Hazan, T., & Shashua, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.3262 · Cited by 45
Counting without sampling. New algorithms for enumeration problems using statistical physicsPreprint
Bandyopadhyay, A., & Gamarnik, D. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0510471 · Cited by 45
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.