Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Tight Degree 4 Sum-of-Squares Lower Bound for the Sherrington-Kirkpatrick Hamiltonian (1907.11686v2)

Published 26 Jul 2019 in cs.DS, cond-mat.stat-mech, math.OC, and math.PR

Abstract: We show that, if $\mathbf{W} \in \mathbb{R}{N \times N}{\mathsf{sym}}$ is drawn from the gaussian orthogonal ensemble, then with high probability the degree 4 sum-of-squares relaxation cannot certify an upper bound on the objective $N{-1} \cdot \mathbf{x}\top \mathbf{W} \mathbf{x}$ under the constraints $x_i2 - 1 = 0$ (i.e. $\mathbf{x} \in { \pm 1 }N$) that is asymptotically smaller than $\lambda{\max}(\mathbf{W}) \approx 2$. We also conjecture a proof technique for lower bounds against sum-of-squares relaxations of any degree held constant as $N \to \infty$, by proposing an approximate pseudomoment construction.

Citations (17)

Summary

We haven't generated a summary for this paper yet.