AI Paper Atlas

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

Temporal Variability in Implicit Online Learning

Nicolò Campolongo, Francesco Orabona

NeurIPS 2020 · Bandits and online learning › Online convex optimization and games · approach: Parameter-free non-stationary online learning · 7 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 AdaImplicit adaptive learning rate instead of OGD or plain IOMDImplicit online mirror descent · Synthetic low temporal variability lossescumulative lossImproved
Use implicit updates (IOMD) instead of OGDOnline gradient descent · Synthetic low temporal variability lossescumulative lossNo clear effect
Use implicit algorithms on real classification (hinge loss) and regression (absolute loss) dataOnline learning algorithms · Real-world classification and regression datasetsrobustness / worst-case performanceImproved

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