atlas

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

Information Directed Sampling for Stochastic Bandits With Graph Feedback

AAAI 2018 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms · 19 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 IDS-N, IDSN-LP, and IDS-LP instead of TS-N (ablation)Stochastic bandits with deterministic graph feedback · Deterministic graph feedback, time-invariant and time-variantcumulative regretHelped
Use IDS-N, IDSN-LP, and IDS-LP instead of TS-N (ablation)Stochastic bandits with Erdős-Rényi random graph feedback · Random graph feedback, time-invariant and time-variantaverage regretHelped
Use IDS-LP instead of IDS-N or IDSN-LP (ablation)IDS policies for graph feedback · Deterministic and random graph feedbackcumulative regretMixed
Use TS-N instead of UCB-N, UCB-maxN, or ε_t-greedy-LPStochastic bandits with deterministic graph feedback · Deterministic graph feedbackcumulative regretHelped
Use IDS policies instead of Exp3-SET or Exp3-ResStochastic bandits with Erdős-Rényi random graph feedback · Random graph feedbackaverage regretHelped

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