atlas

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

One More Step Towards Reality: Cooperative Bandits with Imperfect Communication

NeurIPS 2021 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms · 5 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
Probabilistically discard incoming messages using agent-specific probabilitiesRCL-LF · Irregular communication graphsgroup regretHelped
Use probabilistic message discardingRCL-LF · Near-regular communication graphsgroup regretNo clear effect
Incorporate incoming messages as soon as they are available despite stochastic delaysRCL-SD · Stochastic delays; bounded delays with expected delay 10group regretHelped
Use delayed incorporation of messagesDelayed MP-UCB · Perfect communication; multi-star and random tree graphsgroup regretHelped
Use individual UCB1 instead of cooperative message-passingRCL-AC comparison · Adversarial communication; varying corruption εgroup regretHurt
Use cooperative MP-UCB instead of RCL-ACAdversarial communication · Adversarial communication; varying corruption εgroup regretHurt

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