The DOI matches its Crossref record; 256 of the 256 references it cites were found in a registry or an index.
Statistical physics of inference: thresholds and algorithms
Open accessAbstract
Many questions of fundamental interest in today's science can be formulated as inference problems: some partial, or noisy, observations are performed over a set of variables and the goal is to recover, or infer, the values of the variables based on the indirect information contained in the measurements. For such problems, the central scientific questions are: Under what conditions is the information contained in the measurements sufficient for a satisfactory inference to be possible? What are the most efficient algorithms for this task? A growing body of work has shown that often we can understand and locate these fundamental barriers by thinking of them as phase transitions in the sense of statistical physics. Moreover, it turned out that we can use the gained physical insight to develop new promising algorithms. The connection between inference and statistical physics is currently witnessing an impressive renaissance and we review here the current state-of-the-art, with a pedagogical focus on the Ising model which, formulated as an inference problem, we call the planted spin glass. In terms of applications we review two classes of problems: (i) inference of clusters on graphs and networks, with community detection as a special case and (ii) estimating a signal from its noisy linear measurements, with compressed sensing as a case of sparse estimation. Our goal is to provide a pedagogical review for researchers in physics and other fields interested in this fascinating topic.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
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
A fast learning algorithm for deep belief nets
Hinton, G. E., Osindero, S., & Teh, Y.-W. (2006) · Neural Computation · doi:10.1162/neco.2006.18.7.1527 · Cited by 16,336
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502 · cited 3×
“An influential set of works on community detection is due to Mark Newman and collaborators who introduced the so-called modularity function [51, 86, 182]”
BackgroundMonte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 1×
“The Metropolis-Hastings algorithm [125, 209], most commonly used in physics, is based on the comparison of energy cost in one state of a system and a small perturbation of the state (typically the value of one variable is changed).”
MethodInformation theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
The perceptron: A probabilistic model for information storage and organization in the brain.
Rosenblatt, F. (1958) · Psychological Review · doi:10.1037/h0042519 · Cited by 12,280
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
An Introduction To Compressive Sampling
Candes, E. J., & Wakin, M. B. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.914731 · Cited by 10,017
Learning Deep Architectures for AI
Bengio, Y. (2009) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000006 · Cited by 9,239
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
Finding community structure in very large networks
Clauset, A., Newman, M. E. J., & Moore, C. (2004) · Physical Review E · doi:10.1103/physreve.70.066111 · Cited by 7,390
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
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
Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
Onsager, L. (1944) · Physical Review · doi:10.1103/physrev.65.117 · Cited by 6,510
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
Information Theory and Reliable Communication.
Lee, P. M., & Gallager, R. T. (1970) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344305 · Cited by 5,399
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Elad, M., & Aharon, M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881969 · Cited by 5,321
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
Training Products of Experts by Minimizing Contrastive Divergence
Hinton, G. E. (2002) · Neural Computation · doi:10.1162/089976602760128018 · Cited by 4,879 · cited 4×
“Another possible approach to structured prior is not to model the correlations directly, but instead to utilize a bipartite construction via hidden variables, as in the restricted Boltzmann machine (RBM) [103, 104].”
BackgroundInfluentialGreedy layer-wise training of deep networks
Bengio, Y., Lamblin, P., Popovici, D., & Larochelle, H. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0024 · Cited by 4,841 · cited 2×
“• Feature learning in neural network: Arguably one of the most impressive engineering success of the last decade is the design of the so called “deep-learned” neural networks [30, 124, 125].”
BackgroundFinding community structure in networks using the eigenvectors of matrices
Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.74.036104 · Cited by 4,761
An Information Flow Model for Conflict and Fission in Small Groups
Zachary, W. W. (1977) · Journal of Anthropological Research · doi:10.1086/jar.33.4.3629752 · Cited by 4,704
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Solvable Model of a Spin-Glass
Sherrington, D., & Kirkpatrick, S. (1975) · Physical Review Letters · doi:10.1103/physrevlett.35.1792 · Cited by 4,265
Information Theory and Reliable Communication
Bell, D. A. (1969) · Electronics and Power · doi:10.1049/ep.1969.0319 · Cited by 4,012
Algebraic connectivity of graphs
Fiedler, M. (1973) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1973.101168 · Cited by 3,977
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
Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications
Mezard, M., Parisi, G., & Virasoro, M. (1986) · World Scientific Lecture Notes in Physics · doi:10.1142/0271 · Cited by 3,653
Removing electroencephalographic artifacts by blind source separation
Jung, T., Makeig, S., Humphries, C., Lee, T.-W., McKeown, M. J., Iragui, V. J., & Sejnowski, T. J. (2000) · Psychophysiology · doi:10.1017/s0048577200980259 · Cited by 3,334
Sparse Principal Component Analysis
Zou, H., Hastie, T., & Tibshirani, R. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x113430 · Cited by 3,152
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
A Practical Guide to Training Restricted Boltzmann Machines
Hinton, G. E. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_32 · Cited by 2,852 · cited 4×
“Another possible approach to structured prior is not to model the correlations directly, but instead to utilize a bipartite construction via hidden variables, as in the restricted Boltzmann machine (RBM) [103, 104].”
BackgroundInfluentialA blind source separation technique using second-order statistics
Belouchrani, A., Abed-Meraim, K., Cardoso, J.-F., & Moulines, E. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.554307 · Cited by 2,775
Stochastic blockmodels: First steps
Holland, P. W., Laskey, K. B., & Leinhardt, S. (1983) · Social Networks · doi:10.1016/0378-8733(83)90021-7 · Cited by 2,755
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639 · cited 1×
“The key point is that, in this limit, such random graphs can be considered locally as trees [36, 133].”
The political blogosphere and the 2004 U.S. election: divided they blog
Adamic, L. A., & Glance, N. (2005) · Proceedings of the 3rd international workshop on Link discovery · doi:10.1145/1134271.1134277 · Cited by 2,619
Statistical Learning with Sparsity: The Lasso and Generalizations
Hastie, T., Tibshirani, R., & Wainwright, M. (2015) · Chapman & Hall/CRC eBooks · doi:10.1201/b18401 · Cited by 2,520
Message-passing algorithms for compressed sensing
Donoho, D. L., Maleki, A., & Montanari, A. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0909892106 · Cited by 2,416
Lusseau, D., Schneider, K., Boisseau, O. J., Haase, P., Slooten, E., & Dawson, S. M. (2003) · Behavioral Ecology and Sociobiology · doi:10.1007/s00265-003-0651-y · Cited by 2,277
Łuczak, T., Janson, S., & Ruciński, A. (2000) · Cited by 2,192
Theoretical perspective on the glass transition and amorphous materials
Berthier, L., & Biroli, G. (2011) · Reviews of Modern Physics · doi:10.1103/revmodphys.83.587 · Cited by 2,133
Online dictionary learning for sparse coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553463 · Cited by 2,114
Social Structure from Multiple Networks. I. Blockmodels of Roles and Positions
White, H. C., Boorman, S. A., & Breiger, R. L. (1976) · American Journal of Sociology · doi:10.1086/226141 · Cited by 2,097
Stability of the Sherrington-Kirkpatrick solution of a spin glass model
Almeida, J. R. L. D., & Thouless, D. J. (1978) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/11/5/028 · Cited by 2,061
Statistical mechanics of community detection
Reichardt, J., & Bornholdt, S. (2006) · Physical Review E · doi:10.1103/physreve.74.016110 · Cited by 2,048
Stochastic blockmodels and community structure in networks
Karrer, B., & Newman, M. E. J. (2011) · Physical Review E · doi:10.1103/physreve.83.016107 · Cited by 2,025
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
Popoff, S. M., Lerosey, G., Carminati, R., Fink, M., Boccara, A. C., & Gigan, S. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.100601 · Cited by 1,854
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2008) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000001 · Cited by 1,820
Equation of state calculations by fast computing machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · doi:10.2172/4390578 · Cited by 1,701
(2003) · Cited by 1,680
Spin glasses and the statistical mechanics of protein folding.
Bryngelson, J. D., & Wolynes, P. G. (1987) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.84.21.7524 · Cited by 1,634
Bayesian Reasoning and Machine Learning
Barber, D. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804779 · Cited by 1,631
Understanding belief propagation and its generalizations
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2003) · Cited by 1,594
Janson, S., Łuczak, T., & Rucinski, A. (2000) · Wiley eBooks · doi:10.1002/9781118032718 · Cited by 1,545
Controlling waves in space and time for imaging and focusing in complex media
Mosk, A. P., Lagendijk, A., Lerosey, G., & Fink, M. (2012) · Nature Photonics · doi:10.1038/nphoton.2012.88 · Cited by 1,536
Sampling-Based Approaches to Calculating Marginal Densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.2307/2289776 · Cited by 1,504
Monte Carlo Sampling Methods Using Markov Chains and Their Applications
Hastings, W. K. (1970) · Biometrika · doi:10.2307/2334940 · Cited by 1,443
Generalized approximate message passing for estimation with random linear mixing
Rangan, S. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6033942 · Cited by 1,304
Solution of 'Solvable model of a spin glass'
Thouless, D. J., Anderson, P. W., & Palmer, R. G. (1977) · Philosophical Magazine · doi:10.1080/14786437708235992 · Cited by 1,286
Noise Dressing of Financial Correlation Matrices
Laloux, L., Cizeau, P., Bouchaud, J.-P., & Potters, M. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.1467 · Cited by 1,241
Influence maximization in complex networks through optimal percolation
Morone, F., & Makse, H. A. (2015) · Nature · doi:10.1038/nature14604 · Cited by 1,230
Statistical Physics of Spin Glasses and Information Processing: An Introduction
Nishimori, H. (2001) · doi:10.1093/acprof:oso/9780198509417.001.0001 · Cited by 1,182
All of Statistics: A Concise Course in Statistical Inference
Wasserman, L. (2004) · Springer Texts in Statistics · doi:10.1007/978-0-387-21736-9 · Cited by 1,090
Cooperative Game Theory Approaches for Network Partitioning
Avrachenkov, K. E., Kondratev, A. Y., & Mazalov, V. V. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-62389-4_49 · Cited by 1,073
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
Statistical theory of superlattices
Bethe, H. A. (1935) · Proceedings of the Royal Society of London. Series A - Mathematical and Physical Sciences · doi:10.1098/rspa.1935.0122 · Cited by 1,069
Probabilistic Inference Using Markov Chain Monte Carlo Methods
Neal, R. M. (2011) · Cited by 1,047
Scaling concepts for the dynamics of viscous liquids near an ideal glassy state
Kirkpatrick, T. R., Thirumalai, D., & Wolynes, P. G. (1989) · Physical Review A · doi:10.1103/physreva.40.1045 · Cited by 1,038
The Evolution of Random Graphs
Bollobas, B. (1984) · Transactions of the American Mathematical Society · doi:10.2307/1999405 · Cited by 1,023
Where the really hard problems are
Cheeseman, P. C., Kanefsky, B., & Taylor, W. M. (1991) · Cited by 1,004
Analytical solution of the off-equilibrium dynamics of a long-range spin-glass model
Cugliandolo, L. F., & Jorge Kurchan, B. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.173 · Cited by 994
Matrix Completion From a Few Entries
Keshavan, R. H., Montanari, A., & Oh, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046205 · Cited by 974
Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
Baik, J., Ben Arous, G., & Péché, S. (2005) · The Annals of Probability · doi:10.1214/009117905000000233 · Cited by 967
Theory of Financial Risk and Derivative Pricing: From Statistical Physics to Risk Management
Bouchaud, J.-P., & Potters, M. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511753893 · Cited by 878
The Elements of Statistical Learning: Data Mining, Inference, and Prediction
Ruppert, D. (2004) · Journal of the American Statistical Association · doi:10.1198/jasa.2004.s339 · Cited by 825
The Bethe lattice spin glass revisited
Mézard, M., & Parisi, G. (2001) · The European Physical Journal B · doi:10.1007/pl00011099 · Cited by 818
Determining computational complexity from characteristic ‘phase transitions’
Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., & Troyansky, L. (1999) · Nature · doi:10.1038/22055 · Cited by 790
The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing
Bayati, M., & Montanari, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2094817 · Cited by 780
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
GEMAN, S., & GEMAN, D. (1987) · Readings in Computer Vision · doi:10.1016/b978-0-08-051581-6.50057-x · Cited by 750
Decelle, A., Krzakala, F., Moore, C., & Zdeborová, L. (2011) · Physical Review E · doi:10.1103/physreve.84.066106 · Cited by 747
Self-citationStatistical Theory of Superlattices
Bethe, H. A. (1997) · World Scientific Series in 20th Century Physics · doi:10.1142/9789812795755_0010 · Cited by 740
Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach
Pearl, J. (2022) · Probabilistic and Causal Inference · doi:10.1145/3501714.3501727 · Cited by 727
Statistical Learning with Sparsity: The Lasso and Generalizations
O'Brien, C. M. (2016) · International Statistical Review · doi:10.1111/insr.12167 · Cited by 726
Lower Bounds for the Partitioning of Graphs
Donath, W. E., & Hoffman, A. J. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.175.0420 · Cited by 660
Matrix completion from a few entries
Keshavan, R. H., Oh, S., & Montanari, A. (2009) · 2009 IEEE International Symposium on Information Theory · doi:10.1109/isit.2009.5205567 · Cited by 650
Spectral redemption in clustering sparse networks
Krzakala, F., Moore, C., Mossel, E., Neeman, J., Sly, A., Zdeborová, L., & Zhang, P. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1312486110 · Cited by 638
Self-citationStatistical physics of spin glasses and information processing : an introduction
Nishimori, H. (2001) · Cited by 617
Sparse nonnegative solution of underdetermined linear equations by linear programming
Donoho, D. L., & Tanner, J. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0502269102 · Cited by 577
A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors
Tanaka, T. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.804053 · Cited by 562
Optimal storage properties of neural network models
Gardner, E., & Derrida, B. (1988) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/21/1/031 · Cited by 557
Connections between some kinetic and equilibrium theories of the glass transition
Kirkpatrick, T. R., & Wolynes, P. G. (1987) · Physical Review A · doi:10.1103/physreva.35.3072 · Cited by 555
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_5 · Cited by 551
Gibbs states and the set of solutions of random constraint satisfaction problems
Krz̧akała, F., Montanari, A., Ricci-Tersenghi, F., Semerjian, G., & Zdeborová, L. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0703685104 · Cited by 546
Self-citationp-spin-interaction spin-glass models: Connections with the structural glass problem
Kirkpatrick, T. R., & Thirumalai, D. (1987) · Physical Review B · doi:10.1103/physrevb.36.5388 · Cited by 544
Statistical mechanics of learning from examples
Seung, H. S., Sompolinsky, H., & Tishby, N. (1992) · Physical Review A · doi:10.1103/physreva.45.6056 · Cited by 532
Bayesian Compressive Sensing Via Belief Propagation
Baron, D., Sarvotham, S., & Baraniuk, R. G. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2027773 · Cited by 498
Gross, D. J., & Mezard, M. (1984) · Nuclear Physics B · doi:10.1016/0550-3213(84)90237-2 · Cited by 496
Stable and metastable states in mean-field Potts and structural glasses
Kirkpatrick, T. R., & Wolynes, P. G. (1987) · Physical Review B · doi:10.1103/physrevb.36.8552 · Cited by 484
Statistical Mechanics of Learning
Engel, A., & Van den Broeck, C. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9781139164542 · Cited by 483
Exploring artificial intelligence in the new millennium
Lakemeyer, G. (2003) · Cited by 480
Theory of Financial Risk and Derivative Pricing: From Statistical Physics to Risk Management
Bouchaud, J., & Potters, M. (2011) · Cited by 480
Relaxational dynamics of the Edwards-Anderson model and the mean-field theory of spin-glasses
Sompolinsky, H., & Zippelius, A. (1982) · Physical Review B · doi:10.1103/physrevb.25.6860 · Cited by 479
The statistical mechanics of learning a rule
Watkin, T. L. H., Rau, A., & Biehl, M. (1993) · Reviews of Modern Physics · doi:10.1103/revmodphys.65.499 · Cited by 471
Iterative Learning for Reliable Crowdsourcing Systems
Karger, D. R., Oh, S., & Shah, D. (2011) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 468
Solvable spin systems with random interactions
Mattis, D. C. (1976) · Physics Letters A · doi:10.1016/0375-9601(76)90396-0 · Cited by 412
Randomly Spread CDMA: Asymptotics Via Statistical Physics
Guo, D., & Verdu, S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.847700 · Cited by 399
Inference and Phase Transitions in the Detection of Modules in Sparse Networks
Decelle, A., Krzakala, F., Moore, C., & Zdeborová, L. (2011) · Physical Review Letters · doi:10.1103/physrevlett.107.065701 · Cited by 392
Self-citationDynamics of the Structural Glass Transition and thep-Spin—Interaction Spin-Glass Model
Kirkpatrick, T. R., & Thirumalai, D. (1987) · Physical Review Letters · doi:10.1103/physrevlett.58.2091 · Cited by 392
Franklin, J. S. (2005) · The Mathematical Intelligencer · Cited by 392
Advanced mean field methods: theory and practice
Opper, M., & Saad, D. (2001) · Cited by 385
Internal Energy, Specific Heat and Correlation Function of the Bond-Random Ising Model
Nishimori, H. (1981) · Progress of Theoretical Physics · doi:10.1143/ptp.66.1169 · Cited by 382
Mean-field theory of the Potts glass
Gross, D. J., Kanter, I., & Sompolinsky, H. (1985) · Physical Review Letters · doi:10.1103/physrevlett.55.304 · Cited by 377
The Cavity Method at Zero Temperature
Mézard, M., & Parisi, G. (2003) · Journal of Statistical Physics · doi:10.1023/a:1022221005097 · Cited by 367
Spin-glass models as error-correcting codes
Sourlas, N. (1989) · Nature · doi:10.1038/339693a0 · Cited by 359
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
(2011) · Choice Reviews Online · doi:10.5860/choice.49-0826 · Cited by 340
Advanced Mean Field Methods: Theory and Practice
(2001) · The MIT Press eBooks · doi:10.7551/mitpress/1100.001.0001 · Cited by 336
Phase diagrams for dilute spin glasses
Viana, L., & Bray, A. J. (1985) · Journal of Physics C: Solid State Physics · doi:10.1088/0022-3719/18/15/013 · Cited by 335
OUT OF EQUILIBRIUM DYNAMICS IN SPIN-GLASSES AND OTHER GLASSY SYSTEMS
BOUCHAUD, J.-P., CUGLIANDOLO, L. F., KURCHAN, J., & MÉZARD, M. (1997) · Series on Directions in Condensed Matter Physics · doi:10.1142/9789812819437_0006 · Cited by 329
A proof of Alon’s second eigenvalue conjecture and related problems
Friedman, J. (2008) · Memoirs of the American Mathematical Society · doi:10.1090/memo/0910 · Cited by 328
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
A CDMA multiuser detection algorithm on the basis of belief propagation
Kabashima, Y. (2003) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/36/43/030 · Cited by 324
Community detection thresholds and the weak Ramanujan property
Massoulié, L. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591857 · Cited by 316
Large Cliques Elude the Metropolis Process
Jerrum, M. (1992) · Random Structures & Algorithms · doi:10.1002/rsa.3240030402 · Cited by 312
Localization and centrality in networks
Martin, T., Zhang, X., & Newman, M. E. J. (2014) · Physical Review E · doi:10.1103/physreve.90.052808 · Cited by 309
Phase transitions in the coloring of random graphs
Zdeborová, L., & Krząkała, F. (2007) · Physical Review E · doi:10.1103/physreve.76.031131 · Cited by 306
Self-citationThe sphericalp-spin interaction spin-glass model
Crisanti, A., Horner, H., & Sommers, H.-J. (1993) · The European Physical Journal B · doi:10.1007/bf01312184 · Cited by 303
Percolation on Sparse Networks
Karrer, B., Newman, M. E. J., & Zdeborová, L. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.208702 · Cited by 303
Self-citationDrémeau, A., Antoine Liutkus, A., Martina, D., Katz, O., Schülke, C., Krząkała, F., Gigan, S., & Daudet, L. (2015) · Optics Express · doi:10.1364/oe.23.011898 · Cited by 300
Bayesian Approach to Network Modularity
Hofman, J. M., & Wiggins, C. H. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.258701 · Cited by 298
Generating hard satisfiability problems
Selman, B., Mitchell, D. G., & Levesque, H. J. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00045-3 · Cited by 296
The Ehrenfest Classification of Phase Transitions: Introduction and Evolution
Jaeger, G. (1998) · Archive for History of Exact Sciences · doi:10.1007/s004070050021 · Cited by 293
Finding a large hidden clique in a random graph
Alon, N., Krivelevich, M., & Sudakov, B. (1998) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199810/12)13:3/4<457::aid-rsa14>3.3.co;2-k · Cited by 286
Bilinear Generalized Approximate Message Passing—Part I: Derivation
Parker, J. T., Schniter, P., & Cevher, V. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2357776 · Cited by 281
On the convergence of approximate message passing with arbitrary matrices
Rangan, S., Schniter, P., & Fletcher, A. (2014) · 2014 IEEE International Symposium on Information Theory · doi:10.1109/isit.2014.6874830 · Cited by 279
Compressive Phase Retrieval via Generalized Approximate Message Passing
Schniter, P., & Rangan, S. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2386294 · Cited by 279
Storage capacity of memory networks with binary couplings
Krauth, W., & Mézard, M. (1989) · Journal de Physique · doi:10.1051/jphys:0198900500200305700 · Cited by 276
Statistical physics-based reconstruction in compressed sensing
Krząkała, F., Mézard, M., Sausset, F., Sun, Y., & Zdeborová, L. (2012) · HAL · Cited by 267
Self-citationFinding a large hidden clique in a random graph
Alon, N., Krivelevich, M., & Sudakov, B. (1998) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199810/12)13:3/4<457::aid-rsa14>3.0.co;2-w · Cited by 262
Two Solutions to Diluted p-Spin Models and XORSAT Problems
Mézard, M., Ricci-Tersenghi, F., & Zecchina, R. (2003) · Journal of Statistical Physics · doi:10.1023/a:1022886412117 · Cited by 256
Theory of Financial Risk and Derivative Pricing: From Statistical Physics to Risk Management
Breymann, W. (2006) · Journal of the American Statistical Association · doi:10.1198/jasa.2006.s104 · Cited by 246
Rigorous Inequalities Between Length and Time Scales in Glassy Systems
Montanari, A., & Semerjian, G. (2006) · Journal of Statistical Physics · doi:10.1007/s10955-006-9175-y · Cited by 244
Compressive Imaging Using Approximate Message Passing and a Markov-Tree Prior
Som, S., & Schniter, P. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2191780 · Cited by 227
Phase Diagram of Coupled Glassy Systems: A Mean-Field Study
Franz, S., & Giorgio Parisi, A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2486 · Cited by 219
Community detection as an inference problem
Hastings, M. B. (2006) · Physical Review E · doi:10.1103/physreve.74.035102 · Cited by 213
NON-BACKTRACKING RANDOM WALKS MIX FASTER
Alon, N., Benjamini, I., Lubetzky, E., & SODIN, S. (2007) · Communications in Contemporary Mathematics · doi:10.1142/s0219199707002551 · Cited by 213
Universality in polytope phase transitions and message passing algorithms
Bayati, M., Lelarge, M., & Andrea Montanari, A. (2015) · The Annals of Applied Probability · doi:10.1214/14-aap1010 · Cited by 209
A typical reconstruction limit for compressed sensing based on Lp-norm minimization
Kabashima, Y., Wadayama, T., & Tanaka, T. (2009) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2009/09/l09003 · Cited by 209
Krzakala, F., Mézard, M., Sausset, F., Sun, Y., & Zdeborová, L. (2012) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2012/08/p08009 · Cited by 207
Self-citationZeta Functions of Finite Graphs and Representations of p-Adic Groups
Hashimoto, K.-I. (1989) · Automorphic Forms and Geometry of Arithmetic Varieties · doi:10.1016/b978-0-12-330580-0.50015-x · Cited by 194
A proof of alon's second eigenvalue conjecture
Friedman, J. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780646 · Cited by 192
Mulet, R., Pagnani, A., Weigt, M., & Zecchina, R. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.268701 · Cited by 191
Three unfinished works on the optimal storage capacity of networks
Gardner, E., & Derrida, B. (1989) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/22/12/004 · Cited by 188
Zhang, P., & Moore, C. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1409770111 · Cited by 187
Graph Partitioning via Adaptive Spectral Techniques
Coja‐Oghlan, A. (2009) · Combinatorics Probability Computing · doi:10.1017/s0963548309990514 · Cited by 186
Entropy of theK-Satisfiability Problem
Monasson, R., & Zecchina, R. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.3881 · Cited by 185
SK Model: The Replica Solution without Replicas
Mézard, M., Parisi, G., & Virasoro, M. A. (1986) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/1/2/006 · Cited by 181
Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising
Donoho, D. L., Johnstone, I., & Montanari, A. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2239356 · Cited by 177
The Nishimori line and Bayesian statistics
Iba, Y. (1999) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/32/21/302 · Cited by 171
An Iterative Construction of Solutions of the TAP Equations for the Sherrington–Kirkpatrick Model
Bolthausen, E. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-013-1862-3 · Cited by 171
Landscape analysis of constraint satisfaction problems
Krzakala, F., & Kurchan, J. (2007) · Physical Review E · doi:10.1103/physreve.76.021122 · Cited by 162
Self-citationHow to expand around mean-field theory using high-temperature expansions
Georges, A., & Yedidia, J. S. (1991) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/24/9/024 · Cited by 161
Sparse Principal Components Analysis
Johnstone, I. M., & Lu, A. Y. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0901.4392 · Cited by 160
Theory of Probability, A Critical Introductory Treatment.
Kingmán, J. F. C., de Finetti, B., Machı̀, A., et al. (1976) · Journal of the Royal Statistical Society Series A (General) · doi:10.2307/2344846 · Cited by 158
Thouless, D. J. (1986) · Physical Review Letters · doi:10.1103/physrevlett.56.1082 · Cited by 152
A statistical model for tensor PCAPreprint
Andrea Montanari, A., & Richard, É. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1411.1076 · Cited by 152
Advanced mean field methods: theory and practice
Hogan, J. M. (2002) · Neurocomputing · doi:10.1016/s0925-2312(02)00612-4 · Cited by 150
Learning by Message Passing in Networks of Discrete Synapses
Braunstein, A., & Zecchina, R. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.030201 · Cited by 149
Nonparametric belief propagation
Sudderth, E. B., Ihler, A., Isard, M., Freeman, W. T., & Willsky, A. S. (2010) · Communications of the ACM · doi:10.1145/1831407.1831431 · Cited by 149
Information-theoretically optimal sparse PCA
Deshpande, Y., & Andrea Montanari, A. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6875223 · Cited by 140
Decoding Binary Node Labels from Censored Edge Measurements: Phase Transition and Efficient Recovery
Abbe, E. A., Bandeira, A. S., Bracher, A., & Singer, A. (2014) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2014.2368716 · Cited by 137
Optimal Phase Transitions in Compressed Sensing
Wu, Y., & Verdú, S. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2205894 · Cited by 136
Predicting percolation thresholds in networks
Radicchi, F. (2015) · Physical Review E · doi:10.1103/physreve.91.010801 · Cited by 132
Simplest randomK-satisfiability problem
Ricci‐Tersenghi, F., Weigt, M., & Zecchina, R. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.63.026702 · Cited by 129
A ferromagnet with a glass transition
Franz, S., Mézard, M., Ricci‐Tersenghi, F., Weigt, M., & Zecchina, R. (2001) · Europhysics Letters (EPL) · doi:10.1209/epl/i2001-00438-4 · Cited by 129
Least Squares Superposition Codes of Moderate Dictionary Size Are Reliable at Rates up to Capacity
Joseph, A., & Barron, A. R. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2184847 · Cited by 123
Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization
Kabashima, Y., Krząkała, F., Mézard, M., Sakata, A., & Zdeborová, L. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2556702 · Cited by 121
Self-citationFirst-order transition to perfect generalization in a neural network with binary synapses
Györgyi, G. (1990) · Physical Review A · doi:10.1103/physreva.41.7097 · Cited by 116
Approximate Message-Passing Decoder and Capacity Achieving Sparse Superposition Codes
Barbier, J., & Krząkała, F. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2713833 · Cited by 113
Model selection for degree-corrected block models
Yan, X., Shalizi, C. R., Jensen, J. E., Krząkała, F., Moore, C., Zdeborová, L., Zhang, P., & Zhu, Y. (2014) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2014/05/p05007 · Cited by 112
Self-citationExponential complexity of the quantum adiabatic algorithm for certain satisfiability problems
Hen, I., & Young, A. P. (2011) · Physical Review E · doi:10.1103/physreve.84.061152 · Cited by 111
Non-backtracking random walks mix faster
Alon, N., Benjamini, I., Lubetzky, E., et al. (2006) · Cited by 108
Finding Hidden Cliques of Size $$\sqrt{N/e}$$ N / e in Nearly Linear Time
Deshpande, Y., & Andrea Montanari, A. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-014-9215-y · Cited by 105
On the Dynamics of the Glass Transition on Bethe Lattices
Andrea Montanari, A., & Semerjian, G. (2006) · Journal of Statistical Physics · doi:10.1007/s10955-006-9103-1 · Cited by 102
The space of interactions in neural networks: Gardner's computation with the cavity method
Mézard, M. (1989) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/22/12/018 · Cited by 101
Cited by
Machine learning and the physical sciences
Carleo, G., Cirac, I., Cranmer, K., Daudet, L., Schuld, M., Tishby, N., Vogt-Maranto, L., & Zdeborová, L. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.045002 · Cited by 2,417
Self-citationA high-bias, low-variance introduction to Machine Learning for physicists
Mehta, P., Bukov, M., Wang, C.-H., Day, A. G. R., Richardson, C., Fisher, C. K., & Schwab, D. J. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.03.001 · Cited by 920
Plug-and-Play Methods for Magnetic Resonance Imaging: Using Denoisers for Image Recovery
Ahmad, R., Bouman, C. A., Buzzard, G. T., Chan, S., Liu, S., Reehorst, E. T., & Schniter, P. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2019.2949470 · Cited by 261
Inverse statistical problems: from the inverse Ising problem to data science
Nguyen, H. C., Zecchina, R., & Berg, J. (2017) · Advances in Physics · doi:10.1080/00018732.2017.1341604 · Cited by 258
Spectral Entropies as Information-Theoretic Tools for Complex Network Comparison
De Domenico, M., & Biamonte, J. (2016) · Physical Review X · doi:10.1103/physrevx.6.041062 · Cited by 160
Metadata
- Authors
- Zdeborová, L., & Krzakala, F.
- Venue
- Advances in Physics
- Publisher
- Informa UK Limited
- Published
- 2016-08-19
- Volume
- 65
- Issue
- 5
- Pages
- 453-552
- ISSN
- 0001-8732 (ISSN-L)
- 1460-6976
- OpenAlex
- W2151781750
- Cited by
- 440
- References
- 256
- FWCI
- 21.50
- Type
- journal article
- Language
- en
- Open access
- green
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.