Pith. sign in

REVIEW 1 cited by

Learning Linear-Quadratic Regulators Efficiently with only sqrt{T} Regret

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 1902.06223 v2 pith:EIEBSFFO submitted 2019-02-17 cs.LG stat.ML

Learning Linear-Quadratic Regulators Efficiently with only sqrt{T} Regret

classification cs.LG stat.ML
keywords learningregretsqrtabbasi-yadkorialgorithmcomputationally-efficientcontroldean
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We present the first computationally-efficient algorithm with $\widetilde O(\sqrt{T})$ regret for learning in Linear Quadratic Control systems with unknown dynamics. By that, we resolve an open question of Abbasi-Yadkori and Szepesv\'ari (2011) and Dean, Mania, Matni, Recht, and Tu (2018).

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.