atlas

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

Optimal Rates for Bandit Nonstochastic Control

NeurIPS 2023 · Bandits and online learning › Online convex optimization and games · approach: Dynamic and adaptive regret · 0 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 EBPC instead of BPCBandit control with semi-adversarial perturbations · Bandit LQG, known systemregret: \tilde{O}(T^{\frac{3}{4}}) -> \tilde{O}(\sqrt{T})Helped
Apply EBPC after estimating the Markov operator with SysEst-LSBandit LQG with unknown system dynamics · Bandit LQG, unknown systemregretHelped
Use ellipsoidal gradient estimation for quadratic losses with memoryBandit convex optimization with memory · Quadratic strongly convex lossesregret: \tilde{\mathcal{O}}\left(\frac{\beta n}{\sigma}\sqrt{T}\right)Helped
Use EBPC rather than BPCControl of a barely-stable damped double-integrator · Sinusoidal and Gaussian-walk perturbationslossHelped
Use EBPC rather than BPCControl of a barely-stable damped double-integrator · Gaussian perturbationslossNo clear effect

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