atlas

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

Online Learning with Abstention

ICML 2018 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs · 22 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
Use UCB-GT with feedback graphs estimated from past observations instead of UCB-NT with the subset feedback graphUCB-GT · Ten datasets; abstention costs c ∈ {0.1, 0.2, 0.3}regretHelped
Share feedback across experts using the subset feedback graph rather than no feedback sharingUCB-NT · Ten datasetsregretHelped
Use a feedback graph that depends on the current input rather than one based only on past informationUCB-NT · Stochastic online learning with abstentionregretHurt
Estimate richer feedback graphs from past observations while controlling the bias of added edgesUCB-GT · Ten datasetsregretHelped
Increase the abstention cost (ablation)Online learning with abstention · Ten datasetsfraction of points abstained onHurt
Change the number of experts, expert choice, or use extreme abstention costs (ablation)UCB-GT versus UCB-NT · Additional experiments across datasetsregretHelped

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