The SDP value of random 2CSPs

08/02/2021
by   Amulya Musipatla, et al.
0

We consider a very wide class of models for sparse random Boolean 2CSPs; equivalently, degree-2 optimization problems over {± 1}^n. For each model ℳ, we identify the "high-probability value" s^*_ℳ of the natural SDP relaxation (equivalently, the quantum value). That is, for all ε > 0 we show that the SDP optimum of a random n-variable instance is (when normalized by n) in the range (s^*_ℳ-ε, s^*_ℳ+ε) with high probability. Our class of models includes non-regular CSPs, and ones where the SDP relaxation value is strictly smaller than the spectral relaxation value.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/16/2019

The SDP value for random two-eigenvalue CSPs

We precisely determine the SDP value (equivalently, quantum value) of la...
research
03/15/2016

On the exact recovery of sparse signals via conic relaxations

In this note we compare two recently proposed semidefinite relaxations f...
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
04/05/2019

Convex optimization for the densest subgraph and densest submatrix problems

We consider the densest k-subgraph problem, which seeks to identify the ...
research
09/09/2021

Algorithms and Certificates for Boolean CSP Refutation: "Smoothed is no harder than Random"

We present an algorithm for strongly refuting smoothed instances of all ...
research
07/01/2020

On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time

We study the class of networks which can be created in polylogarithmic p...
research
02/19/2021

Confidently Comparing Estimators with the c-value

Modern statistics provides an ever-expanding toolkit for estimating unkn...

Please sign up or login with your details

Forgot password? Click here to reset