Online Optimization and Ambiguity-based Learning of Distributionally Uncertain Dynamic Systems

• Published in: arXiv.org
• Main Authors: Li, Dan, Fooladivanda, Dariush, Martinez, Sonia
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 21.07.2024
• Subjects: Algorithms; Ambiguity; Computer Science - Learning; Computer Science - Systems and Control; Decision theory; Learning; Mathematics - Dynamical Systems; Mathematics - Optimization and Control; Optimization; Robustness; Statistics - Applications; Statistics - Machine Learning
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.2102.09111

This paper proposes a novel approach to construct data-driven online solutions to optimization problems (P) subject to a class of distributionally uncertain dynamical systems. The introduced framework allows for the simultaneous learning of distributional system uncertainty via a parameterized, control-dependent ambiguity set using a finite historical data set, and its use to make online decisions with probabilistic regret function bounds. Leveraging the merits of Machine Learning, the main technical approach relies on the theory of Distributional Robust Optimization (DRO), to hedge against uncertainty and provide less conservative results than standard Robust Optimization approaches. Starting from recent results that describe ambiguity sets via parameterized, and control-dependent empirical distributions as well as ambiguity radii, we first present a tractable reformulation of the corresponding optimization problem while maintaining the probabilistic guarantees. We then specialize these problems to the cases of 1) optimal one-stage control of distributionally uncertain nonlinear systems, and 2) resource allocation under distributional uncertainty. A novelty of this work is that it extends DRO to online optimization problems subject to a distributionally uncertain dynamical system constraint, handled via a control-dependent ambiguity set that leads to online-tractable optimization with probabilistic guarantees on regret bounds. Further, we introduce an online version of Nesterov's accelerated-gradient algorithm, and analyze its performance to solve this class of problems via dissipativity theory.