mlsanityData to 7 Oct 2026

Distributionally Robust Surrogate Optimal Control for High-Dimensional Systems

arXiv 2105.10070 ↗First posted 21 May 2021math.OC cs.SY eess.SYcited by 0

On the map: Offline RL and imitation learning from data → Offline RL algorithms

Abstract (arXiv)

This paper presents a novel methodology for tractably solving optimal control and offline reinforcement learning problems for high-dimensional systems. This work is motivated by the ongoing challenges of safety, computation, and optimality in high-dimensional optimal control. We address these key questions with the following approach. First, we identify a sequence-modeling surrogate methodology which takes as input the initial state and a time series of control inputs, and outputs an approximation of the objective function and trajectories of constraint functions. Importantly this approach entirely absorbs the individual state transition dynamics. The sole dependence on the initial state means we can apply dimensionality reduction to compress the model input while retaining most of its information. Uncertainty in the surrogate objective will affect the result optimality. Critically, however, uncertainty in the surrogate constraint functions will lead to infeasibility, i.e. unsafe actions. When considering offline reinforcement learning, the most significant modeling error will be encountered on out-of-distribution data. Therefore, we apply Wasserstein ambiguity sets to ``robustify'' our surrogate modeling approach subject to worst-case out-of-sample modeling error based on the distribution of test data residuals. We demonstrate the efficacy of this combined approach through a case study of safe optimal fast charging of a high-dimensional lithium-ion battery model at low temperatures.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Offline RL algorithms, one of 13 directions in Offline RL and imitation learning from data. First posted on arXiv 21 May 2021.

Builds on

No reference list yet.

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2021DROMO: Distributionally Robust Offline Model-based Policy Optimization
  2. 2023Achieving the Asymptotically Optimal Sample Complexity of Offline Reinforcement Learning: A DRO-Based Approach
  3. 2024Minimax Optimal and Computationally Efficient Algorithms for Distributionally Robust Offline Reinforcement Learning
  4. 2026Offline Policy Optimization with Posterior Sampling
  5. 2022Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
  6. 2021Safe Continuous Control with Constrained Model-Based Policy Optimization
  7. 2024Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes
  8. 2026Robust Regularized Policy Iteration under Transition Uncertainty