Nonparametric Learning and Earning with One-Point Feedback under Nonstationarity
Not on the map. Why?
Abstract (arXiv)
Firms increasingly rely on dynamic pricing to respond to evolving customer demand, yet in many applications they observe only the revenue generated by a single posted price in each period. At the same time, market conditions may shift gradually or abruptly due to changes in customer preferences, competition, or external shocks. These features create two intertwined challenges: learning the revenue--demand relationship from limited feedback and adapting pricing decisions to a changing environment. We study how a seller can learn and earn effectively under these constraints, without assuming a specific parametric form for demand. We develop a learning framework that updates prices using revenue-based gradient approximations constructed from one observation per period. To address environmental changes, we incorporate a restarting mechanism that periodically refreshes the learning process so that outdated information is discounted. When the degree of nonstationarity is unknown, we further introduce a meta-learning layer to adaptively hedge across multiple restarting schedules. We provide performance guarantees for our approach, showing how cumulative revenue loss relative to a fully informed benchmark depends on both the time horizon and the magnitude of market variation. Simulation experiments using synthetic and real-world data illustrate the effectiveness of the proposed procedures.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 55 references that are in the map. First posted on arXiv 20 May 2026.
Builds on
19 of 55 references.
References · 19
- 2019Introduction to Online Convex Optimizationcited by 803
- 2013Non-stationary Stochastic Optimizationcited by 175
- 2016Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradientcited by 66
- 2017Efficient Contextual Bandits in Non-stationary Worldscited by 62
- 2019Hedging the Drift: Learning to Optimize under Non-Stationaritycited by 46
- 2014Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-stationary Rewardscited by 42
- 2019Bandit Convex Optimization in Non-stationary Environmentscited by 41
- 2017Tracking the Best Expert in Non-stationary Stochastic Environmentscited by 35
- 2018Bandit learning in concave N-person gamescited by 35
- 2021MetaGrad: Adaptation using Multiple Learning Rates in Online Learningcited by 26
- 2017Bandit Convex Optimization for Scalable and Dynamic IoT Managementcited by 24
- 2021Distribution-free Contextual Dynamic Pricingcited by 22
7 more
- 2018On Abruptly-Changing and Slowly-Varying Multiarmed Bandit Problemscited by 15
- 2021Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedbackcited by 15
- 2022Generalizing Gaussian Smoothing for Random Searchcited by 15
- 2019Context-Based Dynamic Pricing with Online Clusteringcited by 14
- 2016(Bandit) Convex Optimization with Biased Noisy Gradient Oraclescited by 12
- 2024Contextual Dynamic Pricing: Algorithms, Optimality, and Local Differential Privacy Constraintscited by 3
- 2025Learning When to Restart: Nonstationary Newsvendor from Uncensored to Censored Demandcited by 2
Built on by
Not cited yet.