AI Paper Atlas

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

Mixability made efficient: Fast online multiclass logistic regression

Rémi Jézéquel, Pierre Gaillard, Alessandro Rudi

NeurIPS 2021 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure · 1 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 GAF instead of ONSOnline Newton Step · vehicle, segment (LIBSVM) with few samplesaveraged online lossImproved
use GAF instead of ONS with many samplesOnline Newton Step · vehicle, shuttle, segmentaveraged online lossNo clear effect
use GAF instead of OGDOnline Gradient Descent · vehicle, shuttle, segmentaveraged online lossNo clear effect
use Monte Carlo approximation with m=100 samplesGAF · experimentsapproximation accuracy: m=100No clear effect
use GAF instead of ONS regret boundOnline Newton Step · multiclass logistic regression, regretregret bound: dKe^B log(n) -> dK(B^2 + B log(n))Improved

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