Pith. sign in

REVIEW 3 cited by

Algorithmic Threshold for Multi-Species 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 2303.12172 v2 pith:CKUOW32G submitted 2023-03-21 math.PR cond-mat.dis-nncs.CCmath-phmath.MP

classification math.PRcond-mat.dis-nncs.CCmath-phmath.MP
keywords glassesmodelssphericalspinalgorithmicevenformulamethod
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We study efficient optimization of the Hamiltonians of multi-species spherical spin glasses. Our results characterize the maximum value attained by algorithms that are suitably Lipschitz with respect to the disorder through a variational principle that we study in detail. We rely on the branching overlap gap property introduced in our previous work and develop a new method to establish it that does not require the interpolation method. Consequently our results apply even for models with non-convex covariance, where the Parisi formula for the true ground state remains open. As a special case, we obtain the algorithmic threshold for all single-species spherical spin glasses, which was previously known only for even models. We also obtain closed-form formulas for pure models which coincide with the $E_{\infty}$ value previously determined by the Kac-Rice formula.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs

    cs.DS 2026-05 unverdicted novelty 7.0 of 10

    Online algorithms achieve multiplicative approximation r^{1/(r-1)} for maximum independent sets in dense r-uniform ER hypergraphs and (max γ_i)^{-1/(r-1)} for balanced sets in r-partite versions, with matching lower bounds.

  2. Ultrametric OGP - parametric RDT \emph{symmetric} binary perceptron connection

    cs.LG 2026-04 unverdicted novelty 7.0 of 10

    Upper bounds on ultrametric OGPs at levels 1 and 2 for symmetric binary perceptrons are approximately 1.6578 and 1.6219, closely matching the 3rd and 4th lifting-level parametric RDT estimates, supporting conjectures ...

  3. Time-inhomogeneous N-particle Branching Brownian Motion and the continuous random energy model

    math.PR 2024-02 unverdicted novelty 6.0 of 10

    Proves second-order asymptotics for maximal displacement in time-inhomogeneous N-particle branching Brownian motion with a transition at log N ≈ T^{1/3}, recovering Brunet-Derrida behavior when log N ≪ T^{1/3}, and in...

Pith tools