REVIEW 2 cited by
A Constructive Proof of the Spherical Parisi Formula
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The Parisi formula for the free energy is among the crown jewels in the theory of spin glasses. We present a simpler proof of the lower bound in the case of the spherical mean-field model. Our method follows the TAP approach developed recently in e.g. (Subag, 2018): we obtain an ultrametric tree of pure states, each with approximately the same free energy as the entire model, which are hierarchically arranged in accordance with the Parisi ansatz. We construct this tree ``layer by layer'' given the minimizer to Parisi's variational problem. On overlap intervals with full RSB, the tree is built by an optimization algorithm due to Subag. On overlap intervals with finite RSB, the tree is constructed by a new truncated second moment argument; a similar argument also characterizes the free energy of the resulting pure states. Notably we do not use the Aizenman--Sims--Starr scheme, and require interpolation bounds only up to the 1RSB level. Our methods also yield results for large deviations of the ground state, including the entire upper tail rate function for all 1RSB models without external field.
Forward citations
Cited by 2 Pith papers
-
Large deviations for the maximum of the generalized TAP free energy
The large-deviation exponent for existence of TAP maxima equals the Legendre transform of a constrained Parisi value, not the ordinary annealed complexity.
-
Balanced multi-species spin glasses
A lower bound shows balanced multi-species spin glasses have free energy at least that of a single-species model with variance-matched couplings, and this bound is sharp in several regimes.
Discussion (0). Continue with ORCID to comment.