Pith. sign in

REVIEW 4 cited by

Fl RDT based ultimate lowering of the negative spherical perceptron capacity

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

arxiv 2312.16531 v1 pith:7ONW63JA submitted 2023-12-27 stat.ML cond-mat.dis-nncs.ITcs.LGmath.ITmath.PR

classification stat.MLcond-mat.dis-nncs.ITcs.LGmath.ITmath.PR
keywords citeemphcapacityfullykappanegativerandomspherical
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We consider the classical \emph{spherical} perceptrons and study their capacities. The famous zero-threshold case was solved in the sixties of the last century (see, \cite{Wendel62,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 \cite{SchTir02} and \cite{StojnicGardGen13} where the \emph{positive} threshold ($\kappa\geq 0$) scenario was finally fully settled. While the negative counterpart ($\kappa\leq 0$) remained out of reach, \cite{StojnicGardGen13} did show that the random duality theory (RDT) is still powerful enough to provide excellent upper bounds. Moreover, in \cite{StojnicGardSphNeg13}, a \emph{partially lifted} RDT variant was considered and it was shown that the upper bounds of \cite{StojnicGardGen13} can be lowered. After recent breakthroughs in studying bilinearly indexed (bli) random processes in \cite{Stojnicsflgscompyx23,Stojnicnflgscompyx23}, \emph{fully lifted} random duality theory (fl RDT) was developed in \cite{Stojnicflrdt23}. We here first show that the \emph{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 $\sim 0.1\%$) is achieved already on the third (second non-trivial) level of the \emph{stationarized} full lifting.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. CLuP practically achieves $\sim 1.77$ positive and $\sim 0.33$ negative Hopfield model ground state free energy

    cond-mat.dis-nn 2025-07 conditional novelty 6.0 of 10

    CLuP±Hop approximates Hopfield ground state free energies to within about 0.3% using simple gradient descent, backed by the author's fully lifted random duality theory.

  2. Deep ReLU networks -- injectivity capacity upper bounds

    stat.ML 2024-12 reject novelty 6.0 of 10

    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.

  3. A CLuP algorithm to practically achieve $\sim 0.76$ SK--model ground state free energy

    cond-mat.dis-nn 2025-07 conditional novelty 5.0 of 10

    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.

  4. Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT

    stat.ML 2025-06 conditional novelty 5.0 of 10

    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.

Pith tools