Research map / Bandits and online learning / Online convex optimization and games
Robust Load Balancing with Machine Learned Advice
Sara Ahmadian, Hossein Esfandiari, Vahab Mirrokni, Binghui Peng
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 |
|---|---|---|---|
| increase mixing rate beta (more estimate error) from 0 to 1 (ablation) | d-choice algorithm, Multinomial estimates · synthetic queries | limiting approximation ratio: 1.134 -> 1.729 | Hurt |
| increase mixing rate beta from 0 to 1 (ablation) | d-choice algorithm, Gaussian estimates · synthetic queries | limiting approximation ratio: 1.01 -> 1.62 | Hurt |
| increase mixing rate beta from 0 to 1 (ablation) | d-choice algorithm, Exponential estimates · synthetic queries | limiting approximation ratio: 1.03 -> 1.66 | Hurt |
| build the graph with randomized greedy instead of random or greedy allocation (real data) (ablation) | d-choice algorithm · real query logs AS, EU, NA | max server load | No clear effect |
| build the graph with randomized greedy instead of greedy or random allocation (synthetic) (ablation) | d-choice algorithm · synthetic Multinomial, beta 0 to 1 | limiting approximation ratio | Mixed |
| run d-choice for more queries on real query logs | d-choice algorithm · real query logs AS, EU, NA | max load ratio to lower bound: at most 1.5 -> 1 | Improved |
Closest papers by meaning
- Weight for Robustness: A Comprehensive Approach towards Optimal Fault-Tolerant Asynchronous ML (NeurIPS 2024 · similarity 0.83)
- Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale (NeurIPS 2026 · similarity 0.83)
- Coded Computing for Resilient Distributed Computing: A Learning-Theoretic Framework (NeurIPS 2024 · similarity 0.83)
- Towards Establishing Guaranteed Error for Learned Database Operations (ICLR 2024 · similarity 0.82)
- Accelerating Matroid Optimization through Fast Imprecise Oracles (NeurIPS 2024 · similarity 0.82)
- Query-Limited Community Recovery in Stochastic Block Models (NeurIPS 2026 · similarity 0.82)
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.
