math.OCNov 13, 2026

Online Switching Control as Learning with Experts

Authors: Masataka Nakamura, Kaito Ito, Hideaki Ishii

Organizations: Department of Information Physics and Computing, The University of Tokyo, Tokyo, Japan

Abstract

This paper addresses the problem of online switching control for discrete-time nonlinear systems where a controller is sequentially selected from a finite set of candidates. The goal is to generate an adaptive sequence of controllers to minimize the cumulative cost under unknown disturbances and cost functions. Specifically, we consider a full-information feedback setting where realized disturbance effects and cost functions are available after each selection. Using counterfactual costs computed from historical data, we reduce the online switching control problem to the experts problem with switching costs. Then, we propose an adaptive switching algorithm based on the Hedge algorithm with a switching suppression mechanism. Notably, the proposed algorithm achieves an expected regret of O(Tlog⁡N)O(\sqrt{T\log N}), where TT is the time horizon and NN is the number of candidate controllers, while ensuring uniform boundedness of the state. This matches the optimal regret order for the standard experts problem.

Figures & tables

Explore similar work

Mar 16, 2026

Online Learning for Supervisory Switching Control

We study supervisory switching control for partially-observed linear dynamical systems. The objective is to identify and deploy a suitable controller for the unknown system by periodically selecting among a collection of NN candidate controllers, some of which may destabilize the underlying system. While classical estimator-based supervisory control guarantees asymptotic stability, it lacks quantitative finite-time performance bounds. Conversely, current non-asymptotic methods in both online learning and system identification require restrictive assumptions that are incompatible in a control setting, such as system stability, which preclude testing potentially unstable controllers. To bridge this gap, we propose a novel, non-asymptotic analysis of supervisory control that adapts multi-armed bandit algorithms to a control-theoretic setting. The proposed data-driven algorithm evaluates candidate controllers via scoring criteria that leverage system observability to isolate the effects of state history, enabling both detection of destabilizing controllers and accurate system identification. We present two algorithmic variants with dimension-free, finite-time guarantees, where each identifies the matching controller in O(Nlog⁡2N)O(N \log^2 N) steps, while simultaneously achieving finite L2L_2-gain with respect to system disturbances.
Mar 30, 2026

Policy-Controlled Generalized Share: A General Framework with a Transformer Instantiation for Strictly Online Switching-Oracle Tracking

Static regret to a single expert is often the wrong target for strictly online prediction under non-stationarity, where the best expert may switch repeatedly over time. We study Policy-Controlled Generalized Share (PCGS), a general strictly online framework in which the generalized-share recursion is fixed while the post-loss update controls are allowed to vary adaptively. Its principal instantiation in this paper is PCGS-TF, which uses a causal Transformer as an update controller: after round t finishes and the loss vector is observed, the Transformer outputs the controls that map w_t to w_{t+1} without altering the already committed decision w_t. Under admissible post-loss update controls, we obtain a pathwise weighted regret guarantee for general time-varying learning rates, and a standard dynamic-regret guarantee against any expert path with at most S switches under the constant-learning-rate specialization. Empirically, on a controlled synthetic suite with exact dynamic-programming switching-oracle evaluation, PCGS-TF attains the lowest mean dynamic regret in all seven non-stationary families, with its advantage increasing for larger expert pools. On a reproduced household-electricity benchmark, PCGS-TF also achieves the lowest normalized dynamic regret for S = 5, 10, and 20.
Oct 17, 2026

Revisiting Smoothed Online Learning: Competitive Ratio, Dynamic Regret with Switching Cost, and Best of Both Worlds

We revisit smoothed online learning and develop algorithms with improved competitive ratios, optimal dynamic regret with switching cost, and best-of-both-worlds guarantees. Surprisingly, minimizing the hitting cost alone is max⁡(1,2α)\max(1,\frac{2}α)-competitive for αα-polyhedral functions under the ℓ2\ell_2-norm switching cost and 1+4λ1+\frac{4}λ-competitive for λλ-quadratic growth functions under the squared ℓ2\ell_2-norm switching cost, significantly improving existing guarantees. The polyhedral bound is tight for this naive algorithm, and we establish a matching lower bound for α≥1α\geq1. For convex λλ-quadratic growth hitting costs, minimizing a suitably weighted sum of hitting and squared ℓ2\ell_2-norm switching costs yields a competitive ratio of 1+2λ1+\frac{2}{\sqrtλ}. For dynamic regret with the ℓ2\ell_2-norm switching cost, we develop Smoothed Ader (SAder), which achieves the optimal O(T(1+PT))O(\sqrt{T(1+P_T)}) rate in the standard online convex optimization setting, where PTP_T is the comparator's path-length. Its lookahead version removes the bounded-gradient assumption, and a matching lower bound establishes optimality in this setting. Finally, for convex hitting costs on a bounded convex domain, we develop UDNP to aggregate any two experts in the lookahead setting under both switching costs. Its additional cumulative cost is at most O(1)O(1) relative to the first expert and O(Tlog⁡T)O(\sqrt{T\log T}) relative to the second, yielding best-of-both-worlds guarantees without bounded gradients.