Krauth–Mézard conjecture for the capacity of the binary perceptron
Statement
Let have independent standard Gaussian entries, and consider the set of satisfying entrywise. The largest solvable value of is the capacity, and denote by the constant around which this capacity concentrates. Krauth–Mézard conjecture. The capacity of the binary perceptron concentrates around an explicit constant . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.