Research map / Bandits and online learning / Online convex optimization and games
An $\alpha$-No-Regret Algorithm For Graphical Bilinear Bandits
Geovani Rizk, Igor Colin, Albert Thomas, Rida Laraki, Yann Chevaleyre
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Select the optimistic node-arm pair using graph-weighted rewards for both cut edges and within-partition edges (ablation) | OFUL for graphical bilinear bandits · Complete, random, and circle graphs | alpha-regret guarantee (alpha): 0.505 + 0.495γ + ε vs. 0.5 + 0.5 γ; 0.547 + 0.453γ +ε vs. 0.5 + 0.5 γ; 0.99 + 0.01γ +ε vs. 0.5 + 0.5 γ | Improved |
| Use the improved graph-weighted pair selection (ablation) | OFUL for graphical bilinear bandits · Star and matching graphs | alpha-regret guarantee (alpha): 1 vs. 0.5 + 0.5 γ | Improved |
| Use the first OFUL variant, which selects pairs without weighting within-partition edges (ablation) | Graphical bilinear bandits · Bipartite graphs | alpha-regret guarantee (alpha): α=1 for the improved algorithm; no separate bipartite value for the first variant | No clear effect |
| Use the proposed algorithms instead of Explore-Then-Exploit | Synthetic graphical bilinear bandit datasets · Synthetic datasets | fraction of global reward | Improved |
Closest papers by meaning
- p-Mean Regret for Stochastic Bandits (AAAI 2025 · similarity 0.89)
- Greedy Algorithms for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure (NeurIPS 2025 · similarity 0.89)
- Stochastic contextual bandits with graph feedback: from independence number to MAS number (NeurIPS 2024 · similarity 0.89)
- Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards (NeurIPS 2025 · similarity 0.89)
- On Interpolating Experts and Multi-Armed Bandits (ICML 2024 · similarity 0.88)
- Bayesian Regret Minimization in Offline Bandits (ICML 2024 · similarity 0.88)
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.
