An approximation theory perspective on machine learning

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 y<sub>j</sub> 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.

Institutions

Publication Details

Journal
Neural Networks
Published
2026-03-13
DOI
https://doi.org/10.1016/j.neunet.2026.108841
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An approximation theory perspective on machine learning

Neural Networks
Computability, Logic, AI Algorithms
article

An approximation theory perspective on machine learning

article en

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 y<sub>j</sub> 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.

Neural NetworksVol. 200
Worcester Polytechnic Institute (US), Claremont Graduate University (US)
Openalex Percentile: Top 23%
Computability, Logic, AI Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An approximation theory perspective on machine learning · Neural Networks (2026) | TGRS Research Map | TGRS