AI Paper Atlas

Research map / Bandits and online learning / Multi-armed bandits

Quantum Lipschitz Bandits

Bongsoo Yi, Yue Kang, Yao Li

AAAI 2026 · Bandits and online learning › Multi-armed bandits · approach: Optimal stochastic bandit algorithms · 2 citations (OpenAlex)

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 changedWhereMeasuredEffect
replace classical sampling with quantum Monte Carlo mean estimation in Q-ZoomingZooming algorithm · Lipschitz bandits, triangle, sine and 2-D reward functions, Bernoulli and Gaussian noise (T = 300,000)cumulative regretImproved
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 regretImproved
use elimination-based Q-LAE instead of Q-Zoomingquantum Lipschitz bandits · triangle, sine and 2-D functions, both noise typescumulative regretNo clear effect
switch from Bernoulli bounded noise to Gaussian bounded-variance noiseQ-LAE and Q-Zooming · all three reward functionscumulative regret advantage over ZoomingNo clear effect

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy