Replica Symmetry Breaking Condition Exposed by Random Matrix Calculation of Landscape Complexity
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We start with a rather detailed, general discussion of recent results of the replica approach to statistical mechanics of a single classical particle placed in a random N(≫1)-dimensional Gaussian landscape and confined by a spherically symmetric potential suitably growing at infinity. Then we employ random matrix methods to calculate the density of stationary points, as well as minima, of the associated energy surface. This is used to show that for a generic smooth, concave confining potentials the condition of the zero-temperature replica symmetry breaking coincides with one signaling that both mean total number of stationary points in the energy landscape, and the mean number of minima are exponential in N. For such systems the (annealed) complexity of minima vanishes cubically when approaching the critical confinement, whereas the cumulative annealed complexity vanishes quadratically. Different behaviour reported in our earlier short communication (Fyodorov et al. in JETP Lett. 85:261, 2007) was due to non-analyticity of the hard-wall confinement potential. Finally, for the simplest case of parabolic confinement we investigate how the complexity depends on the index of stationary points. In particular, we show that in the vicinity of critical confinement the saddle-points with a positive annealed complexity must be close to minima, as they must have a vanishing fraction of negative eigenvalues in the Hessian.
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
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
Cited by
Identifying and attacking the saddle point problem in high-dimensional non-convex optimization
Dauphin, Y., Pascanu, R., Gulcehre, C., Cho, K., Ganguli, S., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1406.2572 · Cited by 827
The Loss Surfaces of Multilayer Networks
Choromanska, A., Henaff, M., Mathieu, M., Arous, G. B., & LeCun, Y. (2014) · arXiv · doi:10.48550/arxiv.1412.0233 · Cited by 733
Entropy-SGD: biasing gradient descent into wide valleys*
Chaudhari, P., Choromanska, A., Soatto, S., LeCun, Y., Baldassi, C., Borgs, C., Chayes, J., Sagun, L., & Zecchina, R. (2019) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/ab39d9 · Cited by 291
Random Matrices and Complexity of Spin Glasses
Auffinger, A., Arous, G. B., & Černý, J. (2013) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21422 · Cited by 262
Topological and Dynamical Complexity of Random Neural Networks
Wainrib, G., & Touboul, J. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.118101 · Cited by 124
Metadata
- Authors
- Fyodorov, Y. V., & Williams, I.
- Venue
- Journal of Statistical Physics
- Published
- 2007-09-11
- Volume
- 129
- Issue
- 5-6
- Pages
- 1081-1116
- ISSN
- 0022-4715 (ISSN-L)
- 1572-9613
- OpenAlex
- W2094633476
- Cited by
- 115
- References
- 1
- FWCI
- 2.22
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Replica Symmetry Breaking Condition Exposed by Random Matrix Calculation of Landscape Complexity. https://app.cochat.ai/papers/10.1007/s10955-007-9386-x
- The paper
- Fyodorov, Y. V., & Williams, I. (2007). Replica Symmetry Breaking Condition Exposed by Random Matrix Calculation of Landscape Complexity. Journal of Statistical Physics. https://doi.org/10.1007/s10955-007-9386-x
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.