Capacity lower bound for the Ising perceptron
From MaRDI portal
Publication:5212821
DOI10.1145/3313276.3316383zbMath1447.82025arXiv1809.07742OpenAlexW2963698262MaRDI QIDQ5212821
Publication date: 30 January 2020
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.07742
Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Parallel numerical computation (65Y05) Neural nets applied to problems in time-dependent statistical mechanics (82C32) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Basic methods in statistical mechanics (82M99)
Related Items
The discrete random energy model and one step replica symmetry breaking, Algorithmic pure states for the negative spherical perceptron, The discrepancy of random rectangular matrices, Local convexity of the TAP free energy and AMP convergence for \(\mathbb{Z}_2\)-synchronization, Critical window of the symmetric perceptron, Tractability from overparametrization: the example of the negative perceptron, A Morita Type Proof of the Replica-Symmetric Formula for SK, Sharp threshold for the Ising perceptron model, Clustering of solutions in the symmetric binary perceptron, Shaping the learning landscape in neural networks around wide flat minima
