REVIEW 8 cited by
Another look at the Gardner problem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 8 Pith papers
-
Optimal spectral initializers impact on phase retrieval phase transitions -- an RDT view
Optimal spectral initializers at the theoretical phase retrieval threshold sit in flat landscape regions, so roughly 15% oversampling is needed for reliable descending algorithms.
-
Phase transition of \emph{descending} phase retrieval algorithms
The paper derives RDT-based lower bounds and predicts a phase transition at oversampling ratio α≈1.4 where descending phase retrieval algorithms transition from failing to succeeding, but the key isomorphism with conv...
-
Deep ReLU networks -- injectivity capacity upper bounds
For deep ReLU networks with random Gaussian weights, the paper gives upper bounds on the layer expansion needed for injectivity and finds the expansion need saturates by four layers.
-
A CLuP algorithm to practically achieve $\sim 0.76$ SK--model ground state free energy
The authors propose a CLuP-SK barrier-descent algorithm and report it achieves approximately 0.76 of the SK ground state free energy for n around 2000 to 8000, approaching the theoretical Parisi limit of about 0.763.
-
Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT
For the asymmetric binary perceptron, the worst-case local entropy breaks down for constraint density alpha in (0.77, 0.78), matching replica predictions and the range where fast algorithms stop working.
-
Fully lifted \emph{blirp} interpolation -- a large deviation view
A large-deviation upgrade of fully lifted blirp interpolation is derived, yielding explicit derivative identities that the author links to local entropy and computational gaps in perceptron models.
-
Phase retrieval with rank $d$ measurements -- \emph{descending} algorithms phase transitions
For rank d phase retrieval with Gaussian measurements, descending gradient algorithms are predicted to succeed above a sample complexity ratio near 2.79 for d=2, with lifted bounds lowering this estimate and simulatio...
-
A large deviation view of \emph{stationarized} fully lifted blirp interpolation
The paper derives new derivative identities for a stationarized fully lifted bilinearly indexed random process interpolator and states an equality between large deviation limits at the opposite ends of an interpolation path.
Discussion (0). Continue with ORCID to comment.