AI Paper Atlas

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

Contextual Dynamic Pricing with Unknown Noise: Explore-then-UCB Strategy and Improved Regrets

Yiyun Luo, Will Wei Sun, Yufeng Liu

NeurIPS 2022 · Bandits and online learning › Online convex optimization and games · approach: Learning for pricing and auctions · 0 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
choose beta=2/3, gamma=1/6 under Lipschitz and 2nd-order smoothness (Case A)ExUCB · Simulation Case (A)regret rate exponent: slope 0.670Improved
choose beta=3/4, gamma=1/4 under Lipschitz-only assumption (Case B)ExUCB · Simulation Case (B)regret rate exponent: slope 0.724Improved
add 2nd-order smoothness assumption on noise distributionExUCB · Theoretical regret boundregret upper bound: T^(3/4) -> T^(2/3)Improved

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