Linear Dynamics meets Linear MDPs: Closed-Form Optimal Policies via Reinforcement Learning
On the map: Deep reinforcement learning methods → RL theory and sample complexity
Abstract (arXiv)
Many applications -- including power systems, robotics, and economics -- involve a dynamical system interacting with a stochastic and hard-to-model environment. We adopt a reinforcement learning approach to control such systems. Specifically, we consider a deterministic, discrete-time, linear, time-invariant dynamical system coupled with a feature-based linear Markov process with an unknown transition kernel. The objective is to learn a control policy that optimizes a quadratic cost over the system state, the Markov process, and the control input. Leveraging both components of the system, we derive an explicit parametric form for the optimal state-action value function and the corresponding optimal policy. Our model is distinct in combining aspects of both classical Linear Quadratic Regulator (LQR) and linear Markov decision process (MDP) frameworks. This combination retains the implementation simplicity of LQR, while allowing for sophisticated stochastic modeling afforded by linear MDPs, without estimating the transition probabilities, thereby enabling direct policy improvement. We use tools from control theory to provide theoretical guarantees on the stability of the system under the learned policy and provide a sample complexity analysis for its convergence to the optimal policy. We illustrate our results via a numerical example that demonstrates the effectiveness of our approach in learning the optimal control policy under partially known stochastic dynamics.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 12 of its 28 references that are in the map. First posted on arXiv 24 Aug 2025.
Builds on
12 of 28 references.
References · 12
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2019Provably Efficient Reinforcement Learning with Linear Function Approximationcited by 520
- 2016Contextual Decision Processes with Low Bellman Rank are PAC-Learnablecited by 292
- 2018Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulatorcited by 250
- 2019Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Boundcited by 201
- 2020Learning Near Optimal Policies with Low Inherent Bellman Errorcited by 181
- 2021Bilinear Classes: A Structural Framework for Provable Generalization in RLcited by 178
- 2017On the Sample Complexity of the Linear Quadratic Regulatorcited by 159
- 2019Formulas for Data-driven Control: Stabilization, Optimality and Robustnesscited by 47
- 2019LQR through the Lens of First Order Methods: Discrete-time Casecited by 40
- 2020Optimizing Static Linear Feedback: Gradient Methodcited by 27
- 2018Data-Driven LQR Control Designcited by 5
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2024Model-free optimal controller for discrete-time Markovian jump linear systems: A Q-learning approach
- 2025Reconciling Discrete-Time Mixed Policies and Continuous-Time Relaxed Controls in Reinforcement Learning and Stochastic Control
- 2024Optimizing Load Scheduling in Power Grids Using Reinforcement Learning and Markov Decision Processes
- 2026Mathematical methods of reinforcement learning
- 2026Cost-Driven Representation Learning for Linear Quadratic Gaussian Control: Part II
- 2026End-to-End Efficient RL for Linear Bellman Complete MDPs with Deterministic Transitions
- 2025Learning-based primal-dual optimal control of discrete-time stochastic systems with multiplicative noise
- 2024Sample and Oracle Efficient Reinforcement Learning for MDPs with Linearly-Realizable Value Functions