pith. sign in

arxiv: 1306.3979 · v1 · pith:KKXXSLFFnew · submitted 2013-06-17 · 🧮 math.OC · math-ph· math.MP· math.PR

Another look at the Gardner problem

classification 🧮 math.OC math-phmath.MPmath.PR
keywords citegardnerproblemstatisticalgar88perceptronanotherapproach
0
0 comments X
read the original abstract

In this paper we revisit one of the classical perceptron problems from the neural networks and statistical physics. In \cite{Gar88} Gardner presented a neat statistical physics type of approach for analyzing what is now typically referred to as the Gardner problem. The problem amounts to discovering a statistical behavior of a spherical perceptron. Among various quantities \cite{Gar88} determined the so-called storage capacity of the corresponding neural network and analyzed its deviations as various perceptron parameters change. In a more recent work \cite{SchTir02,SchTir03} many of the findings of \cite{Gar88} (obtained on the grounds of the statistical mechanics replica approach) were proven to be mathematically correct. In this paper, we take another look at the Gardner problem and provide a simple alternative framework for its analysis. As a result we reprove many of now known facts and rigorously reestablish a few other results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Ultrametric OGP - parametric RDT \emph{symmetric} binary perceptron connection

    cs.LG 2026-04 unverdicted novelty 7.0

    Upper bounds on ultrametric OGPs at levels 1 and 2 for symmetric binary perceptrons are approximately 1.6578 and 1.6219, closely matching the 3rd and 4th lifting-level parametric RDT estimates, supporting conjectures ...