Research map / Bandits and online learning / Multi-armed bandits
Quantum Lipschitz Bandits
Bongsoo Yi, Yue Kang, Yao Li
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 |
|---|---|---|---|
| replace classical sampling with quantum Monte Carlo mean estimation in Q-Zooming | Zooming algorithm · Lipschitz bandits, triangle, sine and 2-D reward functions, Bernoulli and Gaussian noise (T = 300,000) | cumulative regret | Improved |
| replace classical sampling with quantum Monte Carlo mean estimation in Q-LAE (elimination-based) | Lipschitz adaptive elimination · Lipschitz bandits, triangle, sine and 2-D reward functions, Bernoulli and Gaussian noise (T = 300,000) | cumulative regret | Improved |
| use elimination-based Q-LAE instead of Q-Zooming | quantum Lipschitz bandits · triangle, sine and 2-D functions, both noise types | cumulative regret | No clear effect |
| switch from Bernoulli bounded noise to Gaussian bounded-variance noise | Q-LAE and Q-Zooming · all three reward functions | cumulative regret advantage over Zooming | No clear effect |
Closest papers by meaning
- Quantum Algorithm for Online Exp-concave Optimization (ICML 2024 · similarity 0.88)
- Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss (ICLR 2024 · similarity 0.87)
- Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret (ICML 2024 · similarity 0.86)
- Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes (ICML 2025 · similarity 0.86)
- Quantum Algorithms for Non-smooth Non-convex Optimization (NeurIPS 2024 · similarity 0.86)
- Non-Stationary Lipschitz Bandits (NeurIPS 2025 · 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.
