ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A∈RαN×NA\in\mathbb{R}^{\alpha N\times N} have independent standard Gaussian entries, and consider the set of σ∈{−1,+1}N\sigma\in\{-1,+1\}^N satisfying Aσ>0A\sigma>0 entrywise. The largest solvable value of α\alpha is the capacity, and denote by αc\alpha_c the constant around which this capacity concentrates. Krauth–Mézard conjecture. The capacity of the binary perceptron concentrates around an explicit constant αc≈.833\alpha_c\approx.833. This is a long-standing open problem; a matching rigorous lower bound is known, while the corresponding upper bound remains difficult.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.