Related papers: A Fixed-Depth Size-Hierarchy Theorem for AC$^0[\op…
We introduce a new numerical algorithm based on semidefinite programming to efficiently compute bounds on operator dimensions, central charges, and OPE coefficients in 4D conformal and N=1 superconformal field theories. Using our algorithm,…
We study the problem of learning a high-density region of an arbitrary distribution over $\mathbb{R}^d$. Given a target coverage parameter $\delta$, and sample access to an arbitrary distribution $D$, we want to output a confidence set $S…
We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…
Many canonical machine learning problems boil down to a convex optimization problem with a finite sum structure. However, whereas much progress has been made in developing faster algorithms for this setting, the inherent limitations of…
We show a priori bounds for solutions to $(\partial_t - \Delta) u = \sigma (u) \xi$ in finite volume in the framework of Hairer's Regularity Structures [Invent Math 198:269--504, 2014]. We assume $\sigma \in C_b^2 (\mathbb{R})$ and that…
Consider the following heuristic for building a decision tree for a function $f : \{0,1\}^n \to \{\pm 1\}$. Place the most influential variable $x_i$ of $f$ at the root, and recurse on the subfunctions $f_{x_i=0}$ and $f_{x_i=1}$ on the…
In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function $f$ on $n=2^k$ bits defined by a complete binary tree…
We prove lower bounds for proofs of the bit pigeonhole principle (BPHP) and its generalizations in bounded-depth resolution over parities (Res$(\oplus)$). For weak BPHP$_n^m$ with $m = cn$ pigeons (for any constant $c>1$) and $n$ holes, for…
We study monotone neural networks with threshold gates where all the weights (other than the biases) are non-negative. We focus on the expressive power and efficiency of representation of such networks. Our first result establishes that…
We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…
The diameter $k$-clustering problem is the problem of partitioning a finite subset of $\mathbb{R}^d$ into $k$ subsets called clusters such that the maximum diameter of the clusters is minimized. One early clustering algorithm that computes…
In the Dominated Cluster Deletion problem, we are given an undirected graph $G$ and integers $k$ and $d$ and the question is to decide whether there exists a set of at most $k$ vertices whose removal results in a graph in which each…
In 1966, Kleitman determined the maximum size of a family of subsets of $[n]$ with bounded symmetric difference. Liao, Liu and Yan recently established a vector-space analogue in the cases $n=d+1$ and $n>2d$, and asked for the sharp bound…
Let $p$ be a prime. For $d\in \mathbb{N}$, let $\mathbb{Q}_p^d$ be the standard $d$-dimensional p-adic Hilbert space. Let $m \in \mathbb{N}$ and $\text{Sym}^m(\mathbb{Q}_p^d)$ be the p-adic Hilbert space of symmetric m-tensors. We prove the…
We prove two new upper bounds for depth-2 linear circuits computing the $N$th disjointness matrix $D^{\otimes N}$. First, we obtain a circuit of size $O\big(2^{1.24485N}\big)$ over $\{0,1\}$. Second, we obtain a circuit of degree…
The Erd\H{o}s-Kac theorem is a celebrated result in number theory which says that the number of distinct prime factors of a uniformly chosen random integer satisfies a central limit theorem. In this paper, we establish the large deviations…
We present a classical algorithm that, for any $D$-dimensional geometrically-local, quantum circuit $C$ of polylogarithmic-depth, and any bit string $x \in {0,1}^n$, can compute the quantity $|<x|C|0^{\otimes n}>|^2$ to within any…
A matching cut is a partition of the vertex set of a graph into two sets $A$ and $B$ such that each vertex has at most one neighbor in the other side of the cut. The MATCHING CUT problem asks whether a graph has a matching cut, and has been…
Previous work of the second author and Wolf showed that given a set $A\subseteq \mathbb{F}_p^n$ of bounded $\textrm{VC}_2$-dimension, there is a high rank quadratic factor $\mathcal{B}$ of bounded complexity such that $A$ is approximately…
We extend the work of Hellerman (arxiv:0902.2790) to derive an upper bound on the conformal dimension $\Delta_2$ of the next-to-lowest nontrival primary operator in unitary two-dimensional conformal field theories without chiral primary…