Research map / Bandits and online learning / Online convex optimization and games
Improved Regret Bounds for Bandit Combinatorial Optimization
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-Ichi Kawarabayashi
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 |
|---|---|---|---|
| Use binary {0,1} strongly-correlated losses to derive lower bound, removing the 1/sqrt(log T) factor | Lower bound for bandit combinatorial optimization · Bandit combinatorial optimization, no assumption | regret lower bound: Omega(sqrt(dk^3 T / log T)) -> Omega(sqrt(dk^3 T)) | Improved |
| Restrict losses from continuous [0,1]^d to binary {0,1}^d | Lower-bound construction · Bandit combinatorial optimization | hardness (regret lower bound) | No clear effect |
| Apply the new lower bound to multitask bandit, bandit ranking and multiple-play bandit | Special cases · Bandit ranking with full permutations | regret lower bound tightness | Improved |
| Correlated versus independent losses across arms | Problem hardness · Bandit combinatorial optimization | regret lower bound: Omega(sqrt(dk^2 T)) -> Omega(sqrt(dk^3 T)) | Improved |
Closest papers by meaning
- Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards (NeurIPS 2025 · similarity 0.90)
- Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation (NeurIPS 2026 · similarity 0.90)
- Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits (NeurIPS 2024 · similarity 0.90)
- p-Mean Regret for Stochastic Bandits (AAAI 2025 · similarity 0.90)
- On Interpolating Experts and Multi-Armed Bandits (ICML 2024 · similarity 0.90)
- Combinatorial Stochastic-Greedy Bandit (AAAI 2024 · similarity 0.89)
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.
