mlsanityData to 14 Oct 2026

Fl RDT based ultimate lowering of the negative spherical perceptron capacity

arXiv 2312.16531 ↗First posted 27 Dec 2023stat.ML cond-mat.dis-nn cs.ITcited by 11

Not on the map. Why?

Abstract (arXiv)

We consider the classical spherical perceptrons and study their capacities. The famous zero-threshold case was solved in the sixties of the last century (see, citeWendel62,Winder,Cover65) through the high-dimensional combinatorial considerations. The general threshold, kappa, case though turned out to be much harder and stayed out of reach for the following several decades. A substantial progress was then made in citeSchTir02 and citeStojnicGardGen13 where the positive threshold (kappa≥ 0) scenario was finally fully settled. While the negative counterpart (kappa≤ 0) remained out of reach, citeStojnicGardGen13 did show that the random duality theory (RDT) is still powerful enough to provide excellent upper bounds. Moreover, in citeStojnicGardSphNeg13, a partially lifted RDT variant was considered and it was shown that the upper bounds of citeStojnicGardGen13 can be lowered. After recent breakthroughs in studying bilinearly indexed (bli) random processes in citeStojnicsflgscompyx23,Stojnicnflgscompyx23, fully lifted random duality theory (fl RDT) was developed in citeStojnicflrdt23. We here first show that the negative spherical perceptrons can be fitted into the frame of the fl RDT and then employ the whole fl RDT machinery to characterize the capacity. To be fully practically operational, the fl RDT requires a substantial numerical work. We, however, uncover remarkable closed form analytical relations among key lifting parameters. Such a discovery enables performing the needed numerical calculations to obtain concrete capacity values. We also observe that an excellent convergence (with the relative improvement ~ 0.1%) is achieved already on the third (second non-trivial) level of the stationarized full lifting.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 15 of its 45 references that are in the map. First posted on arXiv 27 Dec 2023.

Builds on

15 of 45 references.

References · 15

  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. 2023Fully lifted random duality theorycited by 18
  6. 2013Discrete perceptronscited by 14
  7. 2013Lifting ℓ1-optimization strong and sectional thresholdscited by 13
  8. 2013Lifting/lowering Hopfield models ground state energiescited by 13
  9. 2020Algorithmic pure states for the negative spherical perceptroncited by 13
  10. 2021Binary perceptron: efficient algorithms can find solutions in a rare well-connected clustercited by 13
  11. 2023Binary perceptrons capacity via fully lifted random duality theorycited by 13
  12. 2021Tractability from overparametrization: The example of the negative perceptroncited by 12
3 more
  1. 2022Algorithms and Barriers in the Symmetric Binary Perceptron Modelcited by 12
  2. 2013Spherical perceptron as a storage memory with limited errorscited by 11
  3. 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: 2024: 5; 2025: 4; 2026: 2.

11 papers.