AI Paper Atlas

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

Decentralized Learning in Online Queuing Systems

Flore Sentenac, Etienne Boursier, Vianney Perchet

NeurIPS 2021 · Bandits and online learning › Online convex optimization and games · approach: Online decision-making with feedback structure · 6 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
Use cooperative decentralized learning with synchronized exploration and shared randomnessADeQuA · Queuing systems with slack η>1strong stability: η>1; η>2Improved
Use ADeQuA instead of EXP3.P.1Toy instance with η<2 · Toy queuing instance, η<2queue stabilityImproved
Use ADeQuA instead of individual no-regret strategiesToy instance with η>2 · Toy queuing instance, η>2learning speedHurt
Use exploration probability proportional to t^(-1/4) rather than t^(-1/5) (ablation)ADeQuA · Toy simulationsexploration speed: t^{-1/4}; t^{-1/5}Improved
Replace regularized dominant mapping with a mapping without the regularizing term (ablation)ADeQuA · Queuing systems with equal or close arrival/service parametersstabilityHurt

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