Research map / Bandits and online learning / Online convex optimization and games
Algorithms for Average Regret Minimization
Sabine Storandt, Stefan Funke
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 heuristic sampling-based volume (eps=0.1) instead of exact volume in greedy (ablation) | Greedy average regret selection · RC synthetic, q=16 | average regret: 2.2 ·10−6 -> 0.0006 (d=3, n=10^6) | Hurt |
| use heuristic sampling-based volume (eps=0.1) instead of exact volume in greedy (ablation) | Greedy average regret selection · RC synthetic, q=16 | running time (s): 1690 -> 0.54 (d=3, n=10^6) | Improved |
| use heuristic instead of exact volume computation (ablation) | Greedy average regret selection · Weather d=2 | average regret: 0.000 -> 0.001 (q=16) | No clear effect |
| decrease sampling eps from 1/20 to 1/40 (ablation) | Heuristic greedy · AirData d=7, q=16 | average regret: 0.1043 -> 0.0715 | Improved |
| decrease sampling eps from 1/20 to 1/40 (ablation) | Heuristic greedy · AirData d=7, q=16 | running time (s): 361 -> 18065 | Hurt |
| use forward greedy instead of reverse greedy (ablation) | Average regret permutation · RC d=4 n=1000 | accumulated regret R: 0.2790 -> 0.0342 | Improved |
| increase k in average k-regret from 1 to 9 (ablation) | Heuristic greedy · AirData d=7, q=8 | average k-regret: 0.0064 -> 0.0001 | Improved |
Closest papers by meaning
- Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case (JMLR 2016 · similarity 0.88)
- p-Mean Regret for Stochastic Bandits (AAAI 2025 · similarity 0.88)
- Weighted Bandits or: How Bandits Learn Distorted Values That Are Not Expected (AAAI 2017 · similarity 0.87)
- Nearly Minimax Optimal Submodular Maximization with Bandit Feedback (NeurIPS 2024 · similarity 0.87)
- Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously (NeurIPS 2024 · similarity 0.87)
- Regret minimization in Linear Bandits with offline data via extended D-optimal exploration. (NeurIPS 2026 · similarity 0.87)
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.
