arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.01874cs.CCmath.CO
收藏

仿射平面上Sherrington-Kirkpatrick方程的平方和下界

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

Mrinalkanti Ghosh, Fernando Granha Jeronimo, Chris Jones, Aaron Potechin, Goutham Rajendran

摘要:

平方和(SoS)层次结构是一种半定规划元算法,其为许多优化问题(例如Max- $k$ -CSP和Tensor PCA)捕获最先进的多项式时间保证。另一方面,SoS下限提供了硬度的证据,这与NP硬度可能不可用的平均情况问题特别相关。在本文中,我们考虑以下的平均情况下的问题,我们称之为\emph{Planted Affine Planes}(PAP)的问题:给定$m$随机向量$d_1,\ldots,d_m$在$\mathbb{R}^n$,我们可以证明,没有向量$v \in \mathbb{R}^n$,使所有的$u \in [m]$,$\langle v, d_u\rangle^2 = 1$?换句话说,我们能证明$m$随机向量不都包含在两个离原点等距离的平行超平面中吗?我们证明,对于$m \leq n^{3/2-ε}$,以高概率,度- $n^{Ω(ε)}$ SoS未能反驳存在这样一个向量$v$。当向量$d_1,\ldots,d_m$选自多元正态分布时,PAP问题等价于证明$\mathbb{R}^m$的随机$n$维子空间不包含布尔向量的问题.如Mohanty--Raghavendra--Xu [STOC 2020]所示,该问题的下界意味着证明Sherrington-Kirkpatrick Hamilton能量上界问题的下界,因此我们的下界意味着程度- $n^{Ω(ε)}$ SoS Sherrington-Kirkpatrick问题认证版本的下界。

英文摘要:

The Sum-of-Squares (SoS) hierarchy is a semi-definite programming meta-algorithm that captures state-of-the-art polynomial time guarantees for many optimization problems such as Max-$k$-CSPs and Tensor PCA. On the flip side, a SoS lower bound provides evidence of hardness, which is particularly relevant to average-case problems for which NP-hardness may not be available. In this paper, we consider the following average case problem, which we call the \emph{Planted Affine Planes} (PAP) problem: Given $m$ random vectors $d_1,\ldots,d_m$ in $\mathbb{R}^n$, can we prove that there is no vector $v \in \mathbb{R}^n$ such that for all $u \in [m]$, $\langle v, d_u\rangle^2 = 1$? In other words, can we prove that $m$ random vectors are not all contained in two parallel hyperplanes at equal distance from the origin? We prove that for $m \leq n^{3/2-ε}$, with high probability, degree-$n^{Ω(ε)}$ SoS fails to refute the existence of such a vector $v$. When the vectors $d_1,\ldots,d_m$ are chosen from the multivariate normal distribution, the PAP problem is equivalent to the problem of proving that a random $n$-dimensional subspace of $\mathbb{R}^m$ does not contain a boolean vector. As shown by Mohanty--Raghavendra--Xu [STOC 2020], a lower bound for this problem implies a lower bound for the problem of certifying energy upper bounds on the Sherrington-Kirkpatrick Hamiltonian, and so our lower bound implies a degree-$n^{Ω(ε)}$ SoS lower bound for the certification version of the Sherrington-Kirkpatrick problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑