AI Paper Atlas

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

Selecting Near-Optimal Learners via Incremental Data Allocation

AAAI 2016 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs · 34 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 DAUB data allocation instead of full training of all 41 learnerslearner selection · HIGGStraining time (s): 49,905 -> 2,001Helped
use DAUB instead of full traininglearner selection · PARITYtraining time (s): 5,939 -> 397Helped
use DAUB across six benchmarkslearner selection · six real-world datasetsaccuracy loss: avg loss 0.4%, avg speedup 16xHelped
add training-accuracy upper bound f^T to DAUB (ablation)DAUB · HIGGStraining time (s): 17,186 -> 2,001Helped
add training-accuracy upper bound f^T to DAUB (ablation)DAUB · HIGGSallocated samples: 590k -> 372kHelped
add training-accuracy upper bound f^T to DAUB (ablation)DAUB · PARITYtraining time (s): 617 -> 397Helped
add training-accuracy upper bound f^T to DAUB (ablation)DAUB · HIGGSiterations: 105 -> 56Helped
add training-accuracy upper bound f^T to DAUB (ablation)DAUB · PARITYiterations: 26 -> 19Helped

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