Pith. sign in

REVIEW 1 cited by

Reinforcement Learning with Fast Stabilization in 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 2007.12291 v2 pith:2NTUNMOH submitted 2020-07-23 cs.LG math.OCstat.ML

Reinforcement Learning with Fast Stabilization in Linear Dynamical Systems

classification cs.LG math.OCstat.ML
keywords algorithmexplorationdynamicalfastimprovedlearningproposedregret
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this work, we study model-based reinforcement learning (RL) in unknown stabilizable linear dynamical systems. When learning a dynamical system, one needs to stabilize the unknown dynamics in order to avoid system blow-ups. We propose an algorithm that certifies fast stabilization of the underlying system by effectively exploring the environment with an improved exploration strategy. We show that the proposed algorithm attains $\tilde{\mathcal{O}}(\sqrt{T})$ regret after $T$ time steps of agent-environment interaction. We also show that the regret of the proposed algorithm has only a polynomial dependence in the problem dimensions, which gives an exponential improvement over the prior methods. Our improved exploration method is simple, yet efficient, and it combines a sophisticated exploration policy in RL with an isotropic exploration strategy to achieve fast stabilization and improved regret. We empirically demonstrate that the proposed algorithm outperforms other popular methods in several adaptive control tasks.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Regret-Guaranteed Safe Switching: LQR Setting with Unknown Dynamics

    eess.SY 2026-06 unverdicted novelty 6.0

    Proposes a regret-minimizing algorithm for safe mode switching in unknown-dynamics LQR that achieves expected regret O(|M|^{1/4} n_s^{3/4} + n_m) under infinite mode visits.