We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with "nice" threshold behavior and degree almost as low as the probabilistic polynomials, and a new notion of probabilistic PTFs where we combine the above techniques to achieve even lower degree with similar "nice" threshold behavior. Utilizing these polynomial constructions, we design faster algorithms for a variety of problems:
$\bullet$ Offline Hamming Nearest (and Furthest) Neighbors: Given $n$ red and $n$ blue points in $d$-dimensional Hamming space for $d=c\log n$, we can find an (exact) nearest (or furthest) blue neighbor for every red point in randomized time $n^{2-1/O(\sqrt{c}\log^{2/3}c)}$ or deterministic time $n^{2-1/O(c\log^2c)}$. These also lead to faster MAX-SAT algorithms for sparse CNFs.
$\bullet$ Offline Approximate Nearest (and Furthest) Neighbors: Given $n$ red and $n$ blue points in $d$-dimensional $\ell_1$ or Euclidean space, we can find a $(1+ε)$-approximate nearest (or furthest) blue neighbor for each red point in randomized time near $dn+n^{2-Ω(ε^{1/3}/\log(1/ε))}$.
$\bullet$ SAT Algorithms and Lower Bounds for Circuits With Linear Threshold Functions: We give a satisfiability algorithm for $AC^0[m]\circ LTF\circ LTF$ circuits with a subquadratic number of linear threshold gates on the bottom layer, and a subexponential number of gates on the other layers, that runs in deterministic $2^{n-n^ε}$ time. This also implies new circuit lower bounds for threshold circuits. We also give a randomized $2^{n-n^ε}$-time SAT algorithm for subexponential-size $MAJ\circ AC^0\circ LTF\circ AC^0\circ LTF$ circuits, where the top $MAJ$ gate and middle $LTF$ gates have $O(n^{6/5-δ})$ fan-in.
The algorithmic hardness threshold for continuous random energy models
我们证明了一个算法的硬度结果,找到所谓的\emph{continuous random energy model (CREM)},介绍了Bovier和Kurkova在2004年作为德里达的\emph{generalized random energy model}的扩展的低能量状态。CREM是具有内置分层结构的离散超立方体上的随机能量景观$(X_v)_{v \in \{0,1\}^N}$的模型,并且可以被视为强相关随机能量景观的玩具模型,例如包括Sherrington-Kirkpatrick模型的$p$ -自旋模型家族。CREM由递增函数$A:[0,1]\to[0,1]$参数化,该函数对状态之间的相关性进行编码。我们展示了一个\emph{algorithmic hardness threshold} $x_*$,这是明确的$A$。更确切地说,我们得到两个结果:第一,我们表明,重整化过程结合贪婪搜索产生任何$\varepsilon > 0$的线性时间算法,发现状态$v \in \{0,1\}^N$与$X_v \ge (x_*-\varepsilon) N$。第二,我们表明,值$x_*$基本上是最好的可能性:对于任何$\varepsilon > 0$,任何算法,发现状态$v$与$X_v \ge (x_*+\varepsilon)N$需要指数许多查询的期望和高概率。我们进一步讨论了什么样…
University of Cambridge(剑桥大学);Centrum Wiskunde & Informatica (CWI)(数学与计算机科学中心);Leiden University(莱顿大学);IBM Research, Silicon Valley Lab(IBM硅谷实验室);IBM Research, Cambridge(IBM剑桥研究中心)
A simple algorithmic framework for disambiguation of finite automata
Pontificia Universidad Católica de Chile(智利天主教 Pontificia 大学);Millennium Institute for Foundational Research on Data(数据基础研究中千年研究所);Univ. Artois, CNRS, UMR 8188, Centre de Recherche en Informatique de Lens (CRIL)(阿尔图瓦大学,法国国家科学研究中心,联合研究单位8188,勒讷信息研究中心)