atlas

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

Online Learning for Structured Loss Spaces

AAAI 2018 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs · 1 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 OMD regularizer to s-sparse lossesOMD for prediction with expert advice · s-sparse lossesregret upper bound: 2\sqrt{{\ln (s+1)T}}; standard losses: \sqrt{{2T \ln N}}Helped
Use a regularizer adapted to the low-rank loss subspaceOMD for prediction with expert advice · d-low-rank lossesregret upper bound: 4\sqrt{{dT}}; standard losses: \sqrt{{2T \ln N}}Helped
Add component-specific regularizers and use their sumOMD for additive loss spaces · d-low-rank + epsilon-noise lossesregret upper bound: \sqrt{2(16d+\epsilon)T}Helped
Add component-specific regularizers and use their sumOMD for additive loss spaces · s-sparse + epsilon-noise lossesregret upper bound: 2\sqrt{2(1+\epsilon)\ln (s+1)T}Helped
Add component-specific regularizers and use their sumOMD for additive loss spaces · d-low-rank + s-sparse lossesregret upper bound: 2\sqrt{2(16d+1)\ln (s+1)T}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