Fl RDT based ultimate lowering of the negative spherical perceptron capacity
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
- 2013Regularly random dualitycited by 24
- 2013Another look at the Gardner problemcited by 24
- 2020Discrepancy Minimization via a Self-Balancing Walkcited by 22
- 2021Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric Perceptroncited by 18
- 2023Fully lifted random duality theorycited by 18
- 2013Discrete perceptronscited by 14
- 2013Lifting ℓ1-optimization strong and sectional thresholdscited by 13
- 2013Lifting/lowering Hopfield models ground state energiescited by 13
- 2020Algorithmic pure states for the negative spherical perceptroncited by 13
- 2021Binary perceptron: efficient algorithms can find solutions in a rare well-connected clustercited by 13
- 2023Binary perceptrons capacity via fully lifted random duality theorycited by 13
- 2021Tractability from overparametrization: The example of the negative perceptroncited by 12
3 more
Built on by
Citing papers per year: 2024: 5; 2025: 4; 2026: 2.
11 papers.
- 2025Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDTcited by 5
- 2025A CLuP algorithm to practically achieve ~ 0.76 SK--model ground state free energycited by 5
- 2024Injectivity capacity of ReLU gatescited by 4
- 2024Deep ReLU networks -- injectivity capacity upper boundscited by 3
- 2025CLuP practically achieves ~ 1.77 positive and ~ 0.33 negative Hopfield model ground state free energycited by 3
- 2025Binary perceptron computational gap -- a parametric fl RDT viewcited by 3
- 2024Capacity of the Hebbian-Hopfield network associative memorycited by 1
- 2026Parametric RDT approach to computational gap of symmetric binary perceptroncited by 1
- 2024Exact objectives of random linear programs and mean widths of random polyhedronscited by 0
- 2024Theoretical limits of descending ℓ0 sparse-regression ML algorithmscited by 0
- 2026Ultrametric OGP - parametric RDT symmetric binary perceptron connectioncited by 0
- 2026Ultrametric OGP - parametric RDT symmetric binary perceptron connection21 Apr 2026
- 2026Parametric RDT approach to computational gap of symmetric binary perceptron15 Jan 2026
- 2025Binary perceptron computational gap -- a parametric fl RDT view2 Nov 2025
- 2025CLuP practically achieves ~ 1.77 positive and ~ 0.33 negative Hopfield model ground state free energy30 Jul 2025
- 2025A CLuP algorithm to practically achieve ~ 0.76 SK--model ground state free energy12 Jul 2025
- 2025Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT24 Jun 2025
- 2024Deep ReLU networks -- injectivity capacity upper bounds27 Dec 2024
- 2024Injectivity capacity of ReLU gates28 Oct 2024
- 2024Theoretical limits of descending ℓ0 sparse-regression ML algorithms10 Oct 2024
- 2024Exact objectives of random linear programs and mean widths of random polyhedrons6 Mar 2024
- 2024Capacity of the Hebbian-Hopfield network associative memory4 Mar 2024