Learning Transfer Operators by Kernel Density Estimation
Sudam Surasinghe, Jeremie Fish, Erik M. Bollt

TL;DR
This paper introduces a kernel density estimation approach for learning transfer operators, providing a rigorous analysis and demonstrating improved accuracy over traditional histogram methods through examples with logistic and Markov maps.
Contribution
It recasts transfer operator inference as a density estimation problem, analyzing bias and variance, and compares KDE with HDE, highlighting KDE's superior performance and limitations.
Findings
KDE generally outperforms HDE in accuracy.
KDE has limitations near boundaries and jumps.
The approach is validated on logistic and Markov maps.
Abstract
Inference of transfer operators from data is often formulated as a classical problem that hinges on the Ulam method. The conventional description, known as the Ulam-Galerkin method, involves projecting onto basis functions represented as characteristic functions supported over a fine grid of rectangles. From this perspective, the Ulam-Galerkin approach can be interpreted as density estimation using the histogram method. In this study, we recast the problem within the framework of statistical density estimation. This alternative perspective allows for an explicit and rigorous analysis of bias and variance, thereby facilitating a discussion on the mean square error. Through comprehensive examples utilizing the logistic map and a Markov map, we demonstrate the validity and effectiveness of this approach in estimating the eigenvectors of the Frobenius-Perron operator. We compare the…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
