atlas

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

Adaptive Online Learning in Dynamic Environments

NeurIPS 2018 · Bandits and online learning › Online convex optimization and games · approach: Dynamic and adaptive regret · 70 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
Adapt the step size to unknown comparator path-length using multiple OGD experts and expert trackingOnline gradient descent for general dynamic regret · General dynamic regret (arbitrary comparator sequence)dynamic regret upper bound: O\left(\sqrt{T} (1+P_T)\right) -> O\left(\sqrt{T(1+P_T)} \right)Helped
Use a surrogate loss and shared gradient evaluation for expert updatesAder · General dynamic regret (arbitrary comparator sequence)gradient evaluations per round: O(\log T) -> 1Helped
Use surrogate loss and shared gradient evaluation for expert updatesAder · General dynamic regret (arbitrary comparator sequence)dynamic regret upper boundNo clear effect
Incorporate contraction dynamical models and measure comparator variation by deviation from those modelsAder · Dynamic regret with dynamical modelsdynamic regret upper bound: O(\sqrt{T} (1+P_T')) -> O\left(\sqrt{T(1+P_T')} \right)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