Related Experiment Video
Updated: Jul 9, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
Published on: March 1, 2022
An approximation theory perspective on machine learning
Hrushikesh N Mhaskar1, Efstratios Tsoukanis1, Ameya D Jagtap2
1Institute of Mathematical Sciences, Claremont Graduate University, CA, 91711, USA.
Abstract:
A central problem in machine learning is often formulated as follows: Given a dataset [Formula: see text] , which is a sample drawn from an unknown probability distribution, the goal is to construct a functional model f such that f(x) ≈ y for any (x, y) 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 a fundamental problem in machine learning, approximation theory does not play a central role in the theoretical foundations of the field. One unfortunate consequence of this disconnect is that it is often unclear how well trained models will generalize to unseen or unlabeled data. In this review, we examine some of the shortcomings of the current machine learning framework and explore the reasons for the gap between approximation theory and machine learning practice. We will then review some of recent work that achieves function approximation on unknown manifolds without the need to learn specific manifold features, such as the eigen-decomposition of the Laplace-Beltrami operator or atlas construction. In many machine learning problems, particularly classification tasks, the labels yj are drawn from a finite set of values. We summarize another recent paper that establishes a deep connection between signal separation problems and classification problems, proposing that classification tasks should be approached as instances of signal separation. We conclude by identifying several open research problems that warrant further investigation.
Related Concept Videos
Accuracy, limits, and approximation
Accuracy is defined as the closeness of the measured value to the true or actual value. In engineering mechanics, repeated measurements are taken during theoretical or experimental analyses to ensure that the result is precise and accurate.
The accuracy of any solution is based on the...
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Linearization and Approximation
Application of Linearization and Approximation
Approximate Integration
