Laplace Transform Based Low-Complexity Learning of Continuous Markov Semigroups

Markov processes serve as a universal model for many real-world random processes. This paper presents a data-driven approach for learning these models through the spectral decomposition of the infinitesimal generator (IG) of the Markov semigroup. The unbounded nature of IGs complicates traditional m...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2024-10
Main Authors: Kostic, Vladimir R, Lounici, Karim, Halconruy, Hélène, Devergne, Timothée, Novelli, Pietro, Pontil, Massimiliano
Format: Article
Language:English
Subjects:
Complexity
Eigenvalues
Laplace transforms
Learning
Markov processes
Operators (mathematics)
Random processes
Semigroups
Statistical analysis
Statistical methods
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Markov processes serve as a universal model for many real-world random processes. This paper presents a data-driven approach for learning these models through the spectral decomposition of the infinitesimal generator (IG) of the Markov semigroup. The unbounded nature of IGs complicates traditional methods such as vector-valued regression and Hilbert-Schmidt operator analysis. Existing techniques, including physics-informed kernel regression, are computationally expensive and limited in scope, with no recovery guarantees for transfer operator methods when the time-lag is small. We propose a novel method that leverages the IG's resolvent, characterized by the Laplace transform of transfer operators. This approach is robust to time-lag variations, ensuring accurate eigenvalue learning even for small time-lags. Our statistical analysis applies to a broader class of Markov processes than current methods while reducing computational complexity from quadratic to linear in the state dimension. Finally, we illustrate the behaviour of our method in two experiments.
ISSN:2331-8422