An Approximation Theory Perspective on Machine Learning
Hrushikesh N. Mhaskar, Efstratios Tsoukanis, and Ameya D. Jagtap

TL;DR
This paper explores the role of approximation theory in machine learning, discussing its current limitations and proposing new methods for function approximation on unknown manifolds without explicit manifold feature learning.
Contribution
It introduces novel approaches for function approximation on unknown manifolds, bridging the gap between approximation theory and practical machine learning models.
Findings
Highlights the disconnect between approximation theory and machine learning practice.
Proposes methods for approximation on unknown manifolds without eigen-decomposition.
Discusses emerging trends like neural operators and transformer architectures.
Abstract
A central problem in machine learning is often formulated as follows: Given a dataset , which is a sample drawn from an unknown probability distribution, the goal is to construct a functional model such that for any drawn from the same distribution. Neural networks and kernel-based methods are commonly employed for this task due to their capacity for fast and parallel computation. The approximation capabilities, or expressive power, of these methods have been extensively studied over the past 35 years. In this paper, we will present examples of key ideas in this area found in the literature. We will discuss emerging trends in machine learning including the role of shallow/deep networks, approximation on manifolds, physics-informed neural surrogates, neural operators, and transformer architectures. Despite function approximation being…
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
