Learning a Sparse Representation of Barron Functions with the Inverse Scale Space Flow

This paper presents a method for finding a sparse representation of Barron functions. Specifically, given an $L^2$ function $f,$ the inverse scale space flow is used to find a sparse measure $\mu$ minimising the $L^2$ loss between the Barron function associated to the measure $\mu$ and the function $f.$ The convergence properties of this method are analysed in an ideal setting and in the cases of measurement noise and sampling bias. In an ideal setting the objective decreases strictly monotone in time to a minimizer with $\mathcal{O}(1/t),$ and in the case of measurement noise or sampling bias the optimum is achieved up to a multiplicative or additive constant. This convergence is preserved on discretization of the parameter space, and the minimizers on increasingly fine discretizations converge to the optimum on the full parameter space.

Authors

Publication Details

Journal
Journal of Machine Learning
Published
2025-02-23
DOI
https://doi.org/10.4208/jml.240123
Primary Topic
Anomaly Detection Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Learning a Sparse Representation of Barron Functions with the Inverse Scale Space Flow

Tjeerd Jan Heeringa, Tim Roith null
Journal of Machine Learning
Anomaly Detection Techniques and Applications
article

Learning a Sparse Representation of Barron Functions with the Inverse Scale Space Flow

Tjeerd Jan Heeringa, Tim Roith null
article en

Abstract

This paper presents a method for finding a sparse representation of Barron functions. Specifically, given an $L^2$ function $f,$ the inverse scale space flow is used to find a sparse measure $\mu$ minimising the $L^2$ loss between the Barron function associated to the measure $\mu$ and the function $f.$ The convergence properties of this method are analysed in an ideal setting and in the cases of measurement noise and sampling bias. In an ideal setting the objective decreases strictly monotone in time to a minimizer with $\mathcal{O}(1/t),$ and in the case of measurement noise or sampling bias the optimum is achieved up to a multiplicative or additive constant. This convergence is preserved on discretization of the parameter space, and the minimizers on increasingly fine discretizations converge to the optimum on the full parameter space.

Journal of Machine LearningVol. 4(1)
Openalex Percentile: Top 99%
Anomaly Detection Techniques and Applications
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.