AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Lipschitz Bandits with Batched Feedback

Yasong Feng, Zengfeng Huang, Tianyu Wang

NeurIPS 2022 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms · 6 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
batch the feedback in O(log log T) batches with adaptive partition instead of per-round updates (vs Zooming/HOO)A-BLiN · Lipschitz banditscommunication roundsImproved
use A-BLiN instead of ZoomingA-BLiN · Lipschitz banditstime complexityImproved
use A-BLiN instead of HOOA-BLiN · Lipschitz banditstime complexityImproved
batching feedback in A-BLiN versus fully sequential ZoomingA-BLiN · Lipschitz banditsregret orderNo 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