Asymptotic convexity of wide and shallow neural networks
Vivek Borkar, Parthe Pandit

TL;DR
This paper demonstrates that the input-output map of wide, shallow neural networks approximates a convex function, providing a theoretical explanation for their strong performance.
Contribution
It introduces a theoretical framework showing the asymptotic convexity of wide, shallow neural networks' input-output maps.
Findings
Epigraph of the network's input-output map approximates a convex function
Provides a plausible explanation for the good performance of wide, shallow networks
Establishes a connection between network architecture and convexity properties
Abstract
For a simple model of shallow and wide neural networks, we show that the epigraph of its input-output map as a function of the network parameters approximates epigraph of a. convex function in a precise sense. This leads to a plausible explanation of their observed good performance.
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
TopicsStochastic Gradient Optimization Techniques · Neural Networks and Applications · Machine Learning and ELM
