Infinite-Horizon Distributionally Robust Regret-Optimal Control
Taylan Kargin, Joudi Hajar, Vikrant Malik, Babak Hassibi
Abstract
We study the infinite-horizon distributionally robust (DR) control of linear systems with quadratic costs, where disturbances have unknown, possibly time-correlated distribution within a Wasserstein-2 ambiguity set. We aim to minimize the worst-case expected regret-the excess cost of a causal policy compared to a non-causal one with access to future disturbance. Though the optimal policy lacks a finite-order state-space realization (i.e., it is non-rational), it can be characterized by a finite-dimensional parameter. Leveraging this, we develop an efficient frequency-domain algorithm to compute this optimal control policy and present a convex optimization method to construct a near-optimal state-space controller that approximates the optimal non-rational controller in the -norm. This approach avoids solving a computationally expensive semi-definite program (SDP) that scales with the time horizon in the finite-horizon setting.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6a03dba3-c4d9-4ee7-8bb2-3874eb4c792bBuilds on2
Related papers
- Geometric Exploration for Online ControlOrestis Plevrakis, Elad HazanNeurIPS 2020 · 12 citations
- Distributionally Robust Optimization with Markovian DataMengmeng Li, Tobias Sutter, Daniel KuhnICML 2021 · 11 citations
- A New Approach to Controlling Linear Dynamical SystemsAnand Paresh Brahmbhatt, Gon Buzaglo, Sofiia Druchyna, Elad HazanICLR 2026 · 4 citations
- Approximate Bilevel Difference Convex Programming for Bayesian Risk Markov Decision ProcessesYifan Lin, Enlu ZhouAAAI 2025 · 1 citation
- First-Order Methods for Wasserstein Distributionally Robust MDPJulien Grand-Clément, Christian KroerICML 2021 · 32 citations
