Exact capacity of the \emph{wide} hidden layer treelike neural networks with generic activations
Mihailo Stojnic

TL;DR
This paper derives explicit capacity formulas for wide treelike neural networks with generic activations using advanced Random Duality Theory, confirming results with statistical physics methods and demonstrating rapid convergence of the lifting approach.
Contribution
It introduces a fully lifted RDT framework to precisely analyze the capacity of wide treelike neural networks with various activations, simplifying numerical evaluations.
Findings
Explicit capacity formulas for ReLU, quadratic, erf, and tanh activations.
Rapid convergence of the lifting method within three levels.
Capacity results match those from statistical physics approaches.
Abstract
Recent progress in studying \emph{treelike committee machines} (TCM) neural networks (NN) in \cite{Stojnictcmspnncaprdt23,Stojnictcmspnncapliftedrdt23,Stojnictcmspnncapdiffactrdt23} showed that the Random Duality Theory (RDT) and its a \emph{partially lifted}(pl RDT) variant are powerful tools that can be used for very precise networks capacity analysis. Here, we consider \emph{wide} hidden layer networks and uncover that certain aspects of numerical difficulties faced in \cite{Stojnictcmspnncapdiffactrdt23} miraculously disappear. In particular, we employ recently developed \emph{fully lifted} (fl) RDT to characterize the \emph{wide} () TCM nets capacity. We obtain explicit, closed form, capacity characterizations for a very generic class of the hidden layer activations. While the utilized approach significantly lowers the amount of the needed numerical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Machine Learning and ELM · Model Reduction and Neural Networks
