Approximation in $L^p(\mu)$ with deep ReLU neural networks
Felix Voigtlaender, Philipp Petersen

TL;DR
This paper extends the theoretical understanding of ReLU neural networks' approximation capabilities from Lebesgue measure to general finite Borel measures, relevant for statistical learning.
Contribution
It generalizes existing approximation results for fixed-depth ReLU networks from Lebesgue measure to any finite Borel measure, including data distribution measures.
Findings
Generalization of approximation results to arbitrary finite Borel measures
Applicable to statistical learning scenarios with data distribution measures
Enhances theoretical understanding of ReLU networks' expressive power
Abstract
We discuss the expressive power of neural networks which use the non-smooth ReLU activation function by analyzing the approximation theoretic properties of such networks. The existing results mainly fall into two categories: approximation using ReLU networks with a fixed depth, or using ReLU networks whose depth increases with the approximation accuracy. After reviewing these findings, we show that the results concerning networks with fixed depth--- which up to now only consider approximation in for the Lebesgue measure --- can be generalized to approximation in , for any finite Borel measure . In particular, the generalized results apply in the usual setting of statistical learning theory, where one is interested in approximation in , with the probability measure describing the distribution…
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 · Fuzzy Logic and Control Systems · Model Reduction and Neural Networks
Methods*Communicated@Fast*How Do I Communicate to Expedia?
