AI Paper Atlas

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

Adaptive Selective Sampling for Online Prediction with Experts

Rui M. Castro, Fredrik Hellström, Tim van Erven

NeurIPS 2023 · Bandits and online learning › Online convex optimization and games · approach: Online learning with feedback graphs · 0 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
Adapt label-query probability to weighted expert disagreement while maintaining the full-information regret guaranteeExponentially weighted forecaster · Online prediction with expert adviceexpected regret: \frac{\ln N}{\eta} + \frac{n \eta}{8} -> \frac{\ln N}{\eta} + \frac{n \eta}{8}No clear effect
Use label-efficient sampling rather than collecting every labelExponentially weighted forecaster · Threshold prediction simulationregretMixed
Use adaptive sampling based on weighted disagreementExponentially weighted forecaster · Threshold prediction simulationlabel complexityImproved
Use adaptive sampling without knowledge of the noise parameter κExponentially weighted forecaster · Threshold prediction simulationnormalized regretImproved

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