Capacity Threshold for the Ising Perceptron

We show that the capacity of the Ising perceptron is with high probability upper bounded by the constant <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\alpha_{\star}\approx 0.833$</tex> conjectured by Krauth and Mézard, under the condition that an explicit two-variable function <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathscr{S}_{\star}\left(\lambda_1, \lambda_2\right)$</tex> is maximized at (1,0). The earlier work of Ding and Sun [1] 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ézard,

Authors

Institutions

Publication Details

Published
2024-10-27
DOI
https://doi.org/10.1109/focs61266.2024.00074
Citations
3
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
1.04

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Capacity Threshold for the Ising Perceptron

Brice Huang
3 citations
Neural Networks and Applications
1.04
article

Capacity Threshold for the Ising Perceptron

Brice Huang
article en
3 citations

Abstract

We show that the capacity of the Ising perceptron is with high probability upper bounded by the constant <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\alpha_{\star}\approx 0.833$</tex> conjectured by Krauth and Mézard, under the condition that an explicit two-variable function <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathscr{S}_{\star}\left(\lambda_1, \lambda_2\right)$</tex> is maximized at (1,0). The earlier work of Ding and Sun [1] 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ézard,

Massachusetts Institute of Technology (US)
National Science Foundation
Openalex Percentile: Top 18%
Neural Networks and Applications
1.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.