Capacity lower bound for the Ising perceptron

Abstract

© 2019 Association for Computing Machinery. We consider the Ising perceptron with gaussian disorder, which is equivalent to the discrete cube t´1, `1uN intersected by M random half-spaces. The perceptron’s capacity is the largest integer MN for which the intersection is nonempty. It is conjectured by Krauth and Mézard (1989) that the (random) ratio MN (N converges in probability to an explicit constant α 0.83. Kim and Roche (1998) proved the existence of a positive constant γ such that γ ď MN (N ď 1 ´ γ with high probability; see also Talagrand (1999). In this paper we show that the Krauth–Mézard conjecture αis a lower bound with positive probability, under the condition that an explicit univariate function Spλq is maximized at λ “0. Our proof is an application of the second moment method to a certain slice of perceptron configurations, as selected by the so-called TAP (Thouless, Anderson, and Palmer, 1977) or AMP (approximate message passing) iteration, whose scaling limit has been characterized by Bayati and Montanari (2011) and Bolthausen (2012). For verifying the condition on Spλq we outline one approach, which is implemented in the current version using (nonrigorous) numerical integration packages. In a future version of this paper we intend to complete the verification by implementing a rigorous numerical method.