A Tight Degree 4 Sum-of-Squares Lower Bound for the Sherrington-Kirkpatrick Hamiltonian

07/26/2019
by   Dmitriy Kunisky, et al.
0

We show that, if W∈R^N × N_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·x^Wx under the constraints x_i^2 - 1 = 0 (i.e. x∈{± 1 }^N) that is asymptotically smaller than λ_(W) ≈ 2. We also conjecture a proof technique for lower bounds against sum-of-squares relaxations of any degree held constant as N →∞, by proposing an approximate pseudomoment construction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2022

A degree 4 sum-of-squares lower bound for the clique number of the Paley graph

We prove that the degree 4 sum-of-squares (SOS) relaxation of the clique...
research
11/04/2019

Lifting Sum-of-Squares Lower Bounds: Degree-2 to Degree-4

The degree-4 Sum-of-Squares (SoS) SDP relaxation is a powerful algorithm...
research
09/15/2020

Positivity-preserving extensions of sum-of-squares pseudomoments over the hypercube

We introduce a new method for building higher-degree sum-of-squares lowe...
research
11/03/2021

Polygon Placement Revisited: (Degree of Freedom + 1)-SUM Hardness and an Improvement via Offline Dynamic Rectangle Union

We revisit the classical problem of determining the largest copy of a si...
research
09/03/2020

Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes

The Sum-of-Squares (SoS) hierarchy is a semi-definite programming meta-a...
research
10/16/2021

Algorithmic Thresholds for Refuting Random Polynomial Systems

Consider a system of m polynomial equations {p_i(x) = b_i}_i ≤ m of degr...
research
02/23/2015

Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems

Given a large data matrix A∈R^n× n, we consider the problem of determini...

Please sign up or login with your details

Forgot password? Click here to reset