atlas

Research map / Bandits and online learning / Online convex optimization and games

Efficient Optimistic Exploration in Linear-Quadratic Regulators via Lagrangian Relaxation

ICML 2020 · Bandits and online learning › Online convex optimization and games · approach: Online linear-quadratic control regret · 8 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Lagrangian relaxation with an extended control and dichotomy searchOFULQplus for LQR · LQR, T stepsregret: OFULQplus has a \sqrt{\kappa} dependence in its leading displayed term; LAGLQ has a \kappa^{3/2} dependenceHelped
Relax the per-step confidence constraint to an asymptotic average constraint (ablation)OFULQplus · LQR, T stepsregret: OFULQplus: \wt O\Big( \!\big( \kappa \|P_*\|_2^{2}\!+\!\sqrt{\kappa} \|P_*\|^{3/2}_2 (n\! +\! d) \!\sqrt{n}\big) \sqrt{THurt
Use isotropic perturbations instead of confidence-based optimismLQR exploration · LQR, T stepsregret: \mathcal{R}_{\cecce} = \wt O\big( \|P^*\|_2^{11/2} d\sqrt{n T}\big); \mathcal{R}_{\laglq} = \wt{O} \big( \kappa^{3/2} \|Hurt
Use DSLLQ to solve the relaxed extended LQRLAGLQ · LQR, accuracy εRiccati and Lyapunov equation solves: O\big(\log(\mu_{\max} /\epsilon) \big)Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy