atlas

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

Online Learning with Transductive Regret

NeurIPS 2017 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs · 2 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
Replace Blum and Mansour's fixed-point computation with reduced power method iterations (FASTSWAP) for swap regretswap regret algorithm (FASTSWAP) · synthetic experiments, n in {40,...,200} weighted-majority base learners, 10,000 roundsmaximum number of RPM iterations (tau) neededHelped
Use FASTSWAP per-iteration complexity O(N^2 log T) instead of O(N^3) fixed-point solve, under the minimal-probability assumptionswap regret algorithm (FASTSWAP) · theoretical complexity vs Blum and Mansour (2007)per-iteration complexityHelped
Extend time-selection swap regret algorithm to FASTTIMESELECTTRANSDUCE with per-round cost O(N^2 min{...}+|I|) instead of O(|I| N^N)time-selection swap regret (Khot and Ponnuswami 2008 setting) · theoretical complexityper-iteration complexityHelped

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