Any Target Function Exists in a Neighborhood of Any Sufficiently Wide Random Network: A Geometrical Perspective
Not on the map. Why?
Abstract (arXiv)
It is known that any target function is realized in a sufficiently small neighborhood of any randomly connected deep network, provided the width (the number of neurons in a layer) is sufficiently large. There are sophisticated theories and discussions concerning this striking fact, but rigorous theories are very complicated. We give an elementary geometrical proof by using a simple model for the purpose of elucidating its structure. We show that high-dimensional geometry plays a magical role: When we project a high-dimensional sphere of radius 1 to a low-dimensional subspace, the uniform distribution over the sphere reduces to a Gaussian distribution of negligibly small covariances.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Jan 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 0; 2024: 0; 2025: 1.
5 papers.
- 2022Winning the Lottery Ahead of Time: Efficient Early Network Pruningcited by 21
- 2021Infinite Neural Network Quantum States: Entanglement and Training Dynamicscited by 4
- 2021Approximate Spectral Decomposition of Fisher Information Matrix for Simple ReLU Networkscited by 2
- 2025Dynamic Reinforcement Learning for Actorscited by 1
- 2022Deep Learning in Random Neural Fields: Numerical Experiments via Neural Tangent Kernelcited by 0
- 2025Dynamic Reinforcement Learning for Actors14 Feb 2025
- 2022Winning the Lottery Ahead of Time: Efficient Early Network Pruning21 Jun 2022
- 2022Deep Learning in Random Neural Fields: Numerical Experiments via Neural Tangent Kernel10 Feb 2022
- 2021Infinite Neural Network Quantum States: Entanglement and Training Dynamics1 Dec 2021
- 2021Approximate Spectral Decomposition of Fisher Information Matrix for Simple ReLU Networks30 Nov 2021