Research map / Bandits and online learning / Online convex optimization and games
Lipschitz Bandits with Batched Feedback
Yasong Feng, Zengfeng Huang, Tianyu Wang
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 |
|---|---|---|---|
| batch the feedback in O(log log T) batches with adaptive partition instead of per-round updates (vs Zooming/HOO) | A-BLiN · Lipschitz bandits | communication rounds | Improved |
| use A-BLiN instead of Zooming | A-BLiN · Lipschitz bandits | time complexity | Improved |
| use A-BLiN instead of HOO | A-BLiN · Lipschitz bandits | time complexity | Improved |
| batching feedback in A-BLiN versus fully sequential Zooming | A-BLiN · Lipschitz bandits | regret order | No clear effect |
Closest papers by meaning
- Lipschitz Dueling Bandits over Continuous Action Spaces (NeurIPS 2026 · similarity 0.90)
- Non-Stationary Lipschitz Bandits (NeurIPS 2025 · similarity 0.89)
- Optimal Batched Linear Bandits (ICML 2024 · similarity 0.89)
- Optimal and Practical Batched Linear Bandit Algorithm (ICML 2025 · similarity 0.88)
- Batched Stochastic Linear Bandits with 1-Bit Communication Constraints (NeurIPS 2026 · similarity 0.88)
- Multiobjective Lipschitz Bandits under Lexicographic Ordering (AAAI 2024 · similarity 0.86)
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.
