Pith. sign in

REVIEW 2 cited by

Implications of Regret on Stability of Linear Dynamical Systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.07411 v2 pith:HCBODIZK submitted 2022-11-14 eess.SY cs.LGcs.SY

classification eess.SYcs.LGcs.SY
keywords linearregretstabilitylearningstatesystemsagentbounded
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The setting of an agent making decisions under uncertainty and under dynamic constraints is common for the fields of optimal control, reinforcement learning, and recently also for online learning. In the online learning setting, the quality of an agent's decision is often quantified by the concept of regret, comparing the performance of the chosen decisions to the best possible ones in hindsight. While regret is a useful performance measure, when dynamical systems are concerned, it is important to also assess the stability of the closed-loop system for a chosen policy. In this work, we show that for linear state feedback policies and linear systems subject to adversarial disturbances, linear regret implies asymptotic stability in both time-varying and time-invariant settings. Conversely, we also show that bounded input bounded state stability and summability of the state transition matrices imply linear regret.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Self-Adaptive Learning and Model Predictive Control for Tracking Unknown Dynamics with No Regret

    cs.RO 2026-07 conditional novelty 6.0 of 10

    A self-adaptive MPC with multiple online-learned RFF predictors and Hedge-based selection achieves O(T^{3/4}) expected regret for tracking unknown, switching target dynamics.

  2. A Spectral Filtering Approach to Regret Analysis of Distributed Online Control for Linear Dynamical Systems

    math.OC 2026-08 conditional novelty 5.0 of 10

    A distributed spectral-filter controller is claimed to achieve O~(n^{3/2} sqrt(T)/((1-beta) gamma^3)) individual regret for networked LTI systems with adversarial disturbances and convex costs.

Pith tools