Online Policy Optimization in Unknown Nonlinear Systems
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
Citing papers per year: 2024: 1; 2025: 2; 2026: 5.
8 papers.
- 2024Mean-Field Sampling for Cooperative Multi-Agent Reinforcement Learningcited by 9
- 2025The Structural Complexity of Matrix-Vector Multiplicationcited by 4
- 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdowncited by 4
- 2026Unsupervised Decomposition and Recombination with Discriminator-Driven Diffusion Modelscited by 3
- 2026Continuous Latent Contexts Enable Efficient Online Learning in Transformerscited by 3
- 2026Learning Approximate Nash Equilibria in Cooperative Multi-Agent Reinforcement Learning via Mean-Field Subsamplingcited by 2
- 2026Graphon Mean-Field Subsampling for Cooperative Heterogeneous Multi-Agent Reinforcement Learningcited by 1
- 2026Role Steering of Language Models for Social Simulationscited by 1
- 2026Role Steering of Language Models for Social Simulations9 Jul 2026
- 2026Continuous Latent Contexts Enable Efficient Online Learning in Transformers11 May 2026
- 2026Learning Approximate Nash Equilibria in Cooperative Multi-Agent Reinforcement Learning via Mean-Field Subsampling4 Mar 2026
- 2026Graphon Mean-Field Subsampling for Cooperative Heterogeneous Multi-Agent Reinforcement Learning18 Feb 2026
- 2026Unsupervised Decomposition and Recombination with Discriminator-Driven Diffusion Models29 Jan 2026
- 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown21 Jul 2025
- 2025The Structural Complexity of Matrix-Vector Multiplication28 Feb 2025
- 2024Mean-Field Sampling for Cooperative Multi-Agent Reinforcement Learning1 Dec 2024