atlas

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

Non-Stochastic Control with Bandit Feedback

NeurIPS 2020 · Bandits and online learning › Online convex optimization and games · approach: Dynamic and adaptive regret · 4 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
introduce intentional delay in gradient updatesBCO with Memory · Bandit convex optimization with memoryregret: \mathcal{O}\left(T^{3/4} H^{3/2} d D^{4/3} G^{2/3} \right)Helped
apply BCO with Memory to train a disturbance action controllerBandit Perturbation Controller · Non-stochastic control, known LDSregret: \mathcal{O}\left(T^{3/4}\log^{5/2}T\right)Helped
add an exploration phase to estimate unknown dynamics before running BPCBPC with system identification · Non-stochastic control, unknown LDSregret: \mathcal{O}\left(T^{3/4}\log^{5/2}T\right)Helped
use perturbation controllers instead of the LQR baselineBPC and GPC · Sinusoidal noise, known dynamicscostHelped
use perturbation controllers instead of the LQR baselineBPC and GPC · i.i.d. Gaussian noise, known dynamicscostNo 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