mlsanityData to 14 Oct 2026

Binary perceptrons capacity via fully lifted random duality theory

arXiv 2312.00073 ↗First posted 29 Nov 2023math.PR cond-mat.dis-nn cs.ITcited by 13

Not on the map. Why?

Abstract (arXiv)

We study the statistical capacity of the classical binary perceptrons with general thresholds kappa. After recognizing the connection between the capacity and the bilinearly indexed (bli) random processes, we utilize a recent progress in studying such processes to characterize the capacity. In particular, we rely on fully lifted random duality theory (fl RDT) established in citeStojnicflrdt23 to create a general framework for studying the perceptrons' capacities. Successful underlying numerical evaluations are required for the framework (and ultimately the entire fl RDT machinery) to become fully practically operational. We present results obtained in that directions and uncover that the capacity characterizations are achieved on the second (first non-trivial) level of stationarized full lifting. The obtained results exactly match the replica symmetry breaking predictions obtained through statistical physics replica methods in citeKraMez89. Most notably, for the famous zero-threshold scenario, kappa=0, we uncover the well known α≈0.8330786 scaled capacity.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 12 of its 53 references that are in the map. First posted on arXiv 29 Nov 2023.

Builds on

12 of 53 references.

References · 12

  1. 2013Regularly random dualitycited by 24
  2. 2013Another look at the Gardner problemcited by 24
  3. 2020Discrepancy Minimization via a Self-Balancing Walkcited by 22
  4. 2021Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptroncited by 18
  5. 2013Discrete perceptronscited by 14
  6. 2013Lifting ℓ1-optimization strong and sectional thresholdscited by 13
  7. 2013Lifting/lowering Hopfield models ground state energiescited by 13
  8. 2020Algorithmic pure states for the negative spherical perceptroncited by 13
  9. 2021Binary perceptron: efficient algorithms can find solutions in a rare well-connected clustercited by 13
  10. 2022Algorithms and Barriers in the Symmetric Binary Perceptron Modelcited by 12
  11. 2013Spherical perceptron as a storage memory with limited errorscited by 11
  12. 2016Box constrained ℓ1 optimization in random linear systems -- asymptoticscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 4; 2025: 5; 2026: 2.

13 papers.

Sort: