Capacity threshold for the Ising perceptron
Abstract
We show that the capacity of the Ising perceptron is with high probability upper bounded by the constant α ≈ 0.833 conjectured by Krauth and M\'ezard, under the condition that an explicit two-variable function S*(λ1,λ2) is maximized at (1,0). The earlier work of Ding and Sun proves the matching lower bound subject to a similar numerical condition, and together these results give a conditional proof of the conjecture of Krauth and M\'ezard.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.