Related papers: Capacity lower bound for the Ising perceptron

We show that the capacity of the Ising perceptron is with high probability upper bounded by the constant $\alpha_\star \approx 0.833$ conjectured by Krauth and M\'ezard, under the condition that an explicit two-variable function…

Determining the capacity $\alpha_c$ of the Binary Perceptron is a long-standing problem. Krauth and Mezard (1989) conjectured an explicit value of $\alpha_c$, approximately equal to .833, and a rigorous lower bound matching this prediction…

We consider the Ising perceptron model with N spins and M = N*alpha patterns, with a general activation function U that is bounded above. For U bounded away from zero, or U a one-sided threshold function, it was shown by Talagrand (2000,…

Consider the discrete cube $\{-1,1\}^N$ and a random collection of half spaces which includes each half space $H(x) := \{y \in \{-1,1\}^N: x \cdot y \geq \kappa \sqrt{N}\}$ for $x \in \{-1,1\}^N$ independently with probability $p$. Is the…

The symmetric binary perceptron ($\mathrm{SBP}_{\kappa}$) problem with parameter $\kappa : \mathbb{R}_{\geq1} \to [0,1]$ is an average-case search problem defined as follows: given a random Gaussian matrix $\mathbf{A} \sim…

Johnson and Lindenstrauss (Contemporary Mathematics, 1984) showed that for $n > m$, a scaled random projection $\mathbf{A}$ from $\mathbb{R}^n$ to $\mathbb{R}^m$ is an approximate isometry on any set $S$ of size at most exponential in $m$.…

We study the statistical capacity of the classical binary perceptrons with general thresholds $\kappa$. After recognizing the connection between the capacity and the bilinearly indexed (bli) random processes, we utilize a recent progress in…

We study the critical window of the symmetric binary perceptron, or equivalently, combinatorial discrepancy. Consider the problem of finding a binary vector $\sigma$ satisfying $\|A\sigma\|_\infty \le K$, where $A$ is an $\alpha n \times n$…

We study the replica-symmetric saddle point equations for the Ising perceptron with Gaussian disorder and margin $\kappa\ge 0$. We prove that for each $\kappa\ge 0$ there is a critical capacity $\alpha_c(\kappa)=\frac{2}{\pi\,\mathbb…

We study the problem of determining the capacity of the binary perceptron for two variants of the problem where the corresponding constraint is symmetric. We call these variants the rectangle-binary-perceptron (RPB) and the…

We consider the spherical perceptron with Gaussian disorder. This is the set $S$ of points $\sigma \in \mathbb{R}^N$ on the sphere of radius $\sqrt{N}$ satisfying $\langle g_a , \sigma \rangle \ge \kappa\sqrt{N}\,$ for all $1 \le a \le M$,…

This paper investigates the bounds on channel capacity and constellation shaping under memoryless mixed noise, which is composed of impulsive noise (IN) and white Gaussian noise (WGN). The capacity bounds are derived using the entropy power…

Given a large sample covariance matrix $S_N=\frac 1n\Gamma_N^{1/2}Z_N Z_N^*\Gamma_N^{1/2}\, ,$ where $Z_N$ is a $N\times n$ matrix with i.i.d. centered entries, and $\Gamma_N$ is a $N\times N$ deterministic Hermitian positive semidefinite…

We study the binary perceptron, a random constraint satisfaction problem that asks to find a Boolean vector in the intersection of independently chosen random halfspaces. A striking feature of this model is that at every positive constraint…

We prove the strong converse for the $N$-source Gaussian multiple access channel (MAC). In particular, we show that any rate tuple that can be supported by a sequence of codes with asymptotic average error probability less than one must lie…

In the negative perceptron problem we are given $n$ data points $({\boldsymbol x}_i,y_i)$, where ${\boldsymbol x}_i$ is a $d$-dimensional vector and $y_i\in\{+1,-1\}$ is a binary label. The data are not linearly separable and hence we…

Let $(M^{n}, g)$ be a closed connected Einstein space, $n=dim M ,$ and $\kappa_{0} $ be the lower bound of the sectional curvature. In this paper, we prove Udo Simon's conjecture: on closed Einstein spaces, $n\geq 3,$ there is no eigenvalue…

Let $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…

Let $\Omega\subset\mathbb{R}^{n+1}$, $n\ge 2$, be a 1-sided non-tangentially accessible domain (aka uniform domain), i.e., a set which satisfies the interior Corkscrew and Harnack chain conditions, respectively scale-invariant/quantitative…

In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…