mlsanityData to 7 Oct 2026

Online Policy Optimization in Unknown Nonlinear Systems

arXiv 2404.13009 ↗First posted 19 Apr 2024math.OCcited by 8

Not on the map. Why?

Abstract (arXiv)

We study online policy optimization in nonlinear time-varying dynamical systems where the true dynamical models are unknown to the controller. This problem is challenging because, unlike in linear systems, the controller cannot obtain globally accurate estimations of the ground-truth dynamics using local exploration. We propose a meta-framework that combines a general online policy optimization algorithm (textttALG) with a general online estimator of the dynamical system's model parameters (textttEST). We show that if the hypothetical joint dynamics induced by textttALG with known parameters satisfies several desired properties, the joint dynamics under inexact parameters from textttEST will be robust to errors. Importantly, the final policy regret only depends on textttEST's predictions on the visited trajectory, which relaxes a bottleneck on identifying the true parameters globally. To demonstrate our framework, we develop a computationally efficient variant of Gradient-based Adaptive Policy Selection, called Memoryless GAPS (M-GAPS), and use it to instantiate textttALG. Combining M-GAPS with online gradient descent to instantiate textttEST yields (to our knowledge) the first local regret bound for online policy optimization in nonlinear time-varying systems with unknown dynamics.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Apr 2024.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 5.

8 papers.