Spherical perceptron as a storage memory with limited errors
Not on the map. Why?
Abstract (arXiv)
It has been known for a long time that the classical spherical perceptrons can be used as storage memories. Seminal work of Gardner, citeGar88, started an analytical study of perceptrons storage abilities. Many of the Gardner's predictions obtained through statistical mechanics tools have been rigorously justified. Among the most important ones are of course the storage capacities. The first rigorous confirmations were obtained in citeSchTir02,SchTir03 for the storage capacity of the so-called positive spherical perceptron. These were later reestablished in citeTalBook and a bit more recently in citeStojnicGardGen13. In this paper we consider a variant of the spherical perceptron that operates as a storage memory but allows for a certain fraction of errors. In Gardner's original work the statistical mechanics predictions in this directions were presented sa well. Here, through a mathematically rigorous analysis, we confirm that the Gardner's predictions in this direction are in fact provable upper bounds on the true values of the storage capacity. Moreover, we then present a mechanism that can be used to lower these bounds. Numerical results that we present indicate that the Garnder's storage capacity predictions may, in a fairly wide range of parameters, be not that far away from the true values.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Jun 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 4; 2024: 4; 2025: 2; 2026: 1.
11 papers.
- 2023Binary perceptrons capacity via fully lifted random duality theorycited by 13
- 2023Fl RDT based ultimate lowering of the negative spherical perceptron capacitycited by 11
- 2025Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDTcited by 5
- 2024Fixed width treelike neural networks capacity analysis -- generic activationscited by 4
- 2024Injectivity capacity of ReLU gatescited by 4
- 2023Capacity of the treelike sign perceptrons neural networks with one hidden layer -- RDT based upper boundscited by 3
- 2023Lifted RDT based capacity analysis of the 1-hidden layer treelike sign perceptrons neural networkscited by 3
- 2024Deep ReLU networks -- injectivity capacity upper boundscited by 3
- 2024Capacity of the Hebbian-Hopfield network associative memorycited by 1
- 2026Parametric RDT approach to computational gap of symmetric binary perceptroncited by 1
- 2025A large deviation view of stationarized fully lifted blirp interpolationcited by 0
- 2026Parametric RDT approach to computational gap of symmetric binary perceptron15 Jan 2026
- 2025Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT24 Jun 2025
- 2025A large deviation view of stationarized fully lifted blirp interpolation24 Jun 2025
- 2024Deep ReLU networks -- injectivity capacity upper bounds27 Dec 2024
- 2024Injectivity capacity of ReLU gates28 Oct 2024
- 2024Capacity of the Hebbian-Hopfield network associative memory4 Mar 2024
- 2024Fixed width treelike neural networks capacity analysis -- generic activations8 Feb 2024
- 2023Fl RDT based ultimate lowering of the negative spherical perceptron capacity27 Dec 2023
- 2023Lifted RDT based capacity analysis of the 1-hidden layer treelike sign perceptrons neural networks13 Dec 2023
- 2023Capacity of the treelike sign perceptrons neural networks with one hidden layer -- RDT based upper bounds13 Dec 2023
- 2023Binary perceptrons capacity via fully lifted random duality theory29 Nov 2023