Pith. sign in

REVIEW 1 cited by

Following the ground-states of full-RSB spherical spin glasses

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

arxiv 1812.04588 v2 pith:YGSSLD3T submitted 2018-12-11 math.PR math-phmath.MP

classification math.PRmath-phmath.MP
keywords energyformulamodelsparisisphericalalgorithmboundcorresponding
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We focus on spherical spin glasses whose Parisi distribution has support of the form $[0,q]$. For such models we construct paths from the origin to the sphere which consistently remain close to the ground-state energy on the sphere of corresponding radius. The construction uses a greedy strategy, which always follows a direction corresponding to the most negative eigenvalues of the Hessian of the Hamiltonian. For finite mixtures $\nu(x)$ it provides an algorithm of time complexity $O(N^{{\rm deg}(\nu)})$ to find w.h.p. points with the ground-state energy, up to a small error. For the pure spherical models, the same algorithm reaches the energy $-E_{\infty}$, the conjectural terminal energy for gradient descent. Using the TAP formula for the free energy, for full-RSB models with support $[0,q]$, we are able to prove the correct lower bound on the free energy (namely, prove the lower bound from Parisi's formula), assuming the correctness of the Parisi formula only in the replica symmetric case.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The Overlap Gap Property in Principal Submatrix Recovery

    math.PR 2019-08 accept novelty 7.0 of 10

    A sharp information-theoretic threshold for approximate recovery of a planted sparse submatrix is derived, and an overlap gap property is proved that blocks local MCMC algorithms in a conjecturally hard phase.

Pith tools