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
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 |
|---|---|---|---|
| choose beta=2/3, gamma=1/6 under Lipschitz and 2nd-order smoothness (Case A) | ExUCB · Simulation Case (A) | regret rate exponent: slope 0.670 | Improved |
| choose beta=3/4, gamma=1/4 under Lipschitz-only assumption (Case B) | ExUCB · Simulation Case (B) | regret rate exponent: slope 0.724 | Improved |
| add 2nd-order smoothness assumption on noise distribution | ExUCB · Theoretical regret bound | regret upper bound: T^(3/4) -> T^(2/3) | Improved |
Closest papers by meaning
- Optimal Contextual Pricing under Agnostic Non-Lipschitz Demand (NeurIPS 2026 · similarity 0.91)
- Improved Algorithms for Contextual Dynamic Pricing (NeurIPS 2024 · similarity 0.90)
- Learning to price with resource constraints: from full information to machine-learned prices (NeurIPS 2025 · similarity 0.90)
- Transfer Learning for Nonparametric Contextual Dynamic Pricing (ICML 2025 · similarity 0.89)
- Pricing with Contextual Elasticity and Heteroscedastic Valuation (ICML 2024 · similarity 0.88)
- Transfer Faster, Price Smarter: Minimax Dynamic Pricing under Cross-Market Preference Shift (NeurIPS 2025 · similarity 0.88)
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.
