Mehler's Formula, Branching Process, and Compositional Kernels of Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
We utilize a connection between compositional kernels and branching processes via Mehler's formula to study deep neural networks. This new probabilistic insight provides us a novel perspective on the mathematical role of activation functions in compositional neural networks. We study the unscaled and rescaled limits of the compositional kernels and explore the different phases of the limiting behavior, as the compositional depth increases. We investigate the memorization capacity of the compositional kernels and neural networks by characterizing the interplay among compositional depth, sample size, dimensionality, and non-linearity of the activation. Explicit formulas on the eigenvalues of the compositional kernel are provided, which quantify the complexity of the corresponding reproducing kernel Hilbert space. On the methodological front, we propose a new random features algorithm, which compresses the compositional layers by devising a new activation function.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 1.
4 papers.
- 2022Wide and Deep Neural Networks Achieve Optimality for Classificationcited by 12
- 2021Deep Networks Provably Classify Data on Curvescited by 6
- 2024Random features and polynomial rulescited by 6
- 2021Probability-Generating Function Kernels for Spherical Datacited by 0
- 2024Random features and polynomial rules15 Feb 2024
- 2022Wide and Deep Neural Networks Achieve Optimality for Classification29 Apr 2022
- 2021Probability-Generating Function Kernels for Spherical Data1 Dec 2021
- 2021Deep Networks Provably Classify Data on Curves29 Jul 2021