Inexact Iterative Numerical Linear Algebra For Neural Network-based Spectral Estimation And Rare-event Prediction

Abstract

Understanding dynamics in complex systems is challenging because there are many degrees of freedom, and those that are most important for describing events of interest are often not obvious. The leading eigenfunctions of the transition operator are useful for visualization, and they can provide an efficient basis for computing statistics such as the likelihood and average time of events (predictions). Here we develop inexact iterative linear algebra methods for computing these eigenfunctions (spectral estimation) and making predictions from a data set of short trajectories sampled at finite intervals. We demonstrate the methods on a low-dimensional model that facilitates visualization and a high-dimensional model of a biomolecular system. Implications for the prediction problem in reinforcement learning are discussed.

Stats

• citations12
• S2 citations—
• github stars0
• HF likes0
• heat score8.35
• arxiv keystrahan2023inexact

Related papers

• Adaptive Input Estimation In Linear Dynamical Systems With Applications To Learning-from-observations (2018)0.00
• Spectral Representation-based Reinforcement Learning (2025)0.00
• Sample Complexity Of Estimating The Policy Gradient For Nearly Deterministic Dynamical Systems (2019)0.00
• Dynode: Neural Ordinary Differential Equations For Dynamics Modeling In Continuous Control (2020)0.00
• Model-free Low-rank Reinforcement Learning Via Leveraged Entry-wise Matrix Estimation (2024)0.00
• Optimistic Active Exploration Of Dynamical Systems (2023)0.00
• Bayesian Inverse Transition Learning: Learning Dynamics From Near-optimal Trajectories (2026)0.00
• Conditionally Elicitable Dynamic Risk Measures For Deep Reinforcement Learning (2022)0.00