Nonparametric Learning and Earning with One-Point Feedback under Nonstationarity

• URL: http://arxiv.org/abs/2605.21263v1
• Date: Wed, 20 May 2026 14:52:03 GMT
• Title: Nonparametric Learning and Earning with One-Point Feedback under Nonstationarity
• Abstract summary: We develop a learning framework that updates prices using revenue-based gradient approximations constructed from one observation per period.<n>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.
• Score: 8.48495542754409
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Learning Fair Demand Models [2.317318456608172]
  Data-driven pricing is increasingly prevalent in sectors such as airlines, lending, insurance, and retail.<n>We study a model where a seller has a two-stage decision pipeline comprising linear demand model estimation followed by price optimization.<n>We show that equalizing training loss across consumer groups leads to multiple solutions, which in turn can result in undesirable outcomes.
  arXiv  Detail & Related papers  (2026-06-05T02:12:07Z)
• From Confounding to Learning: Dynamic Service Fee Pricing on Third-Party Platforms [16.56794300689239]
  We study the pricing behavior of third-party platforms facing strategic agents.<n>We develop an algorithm with optimal regret of $TildecO(sqrtTwedge_S-2)$.
  arXiv  Detail & Related papers  (2025-12-28T02:41:36Z)
• The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability [93.11220429350278]
  Information asymmetry is a pervasive feature of multi-agent systems.<n>This paper explores a fundamental question in online learning: Can we employ non-i.i.d. actions to learn about confounders even when requiring knowledge transfer?<n>We present a sample-efficient algorithm designed to accurately identify system dynamics under information asymmetry and to navigate the challenges of knowledge transfer effectively in reinforcement learning.
  arXiv  Detail & Related papers  (2025-06-11T17:06:57Z)
• Leveraging Microservices Architecture for Dynamic Pricing in the Travel Industry: Algorithms, Scalability, and Impact on Revenue and Customer Satisfaction [1.03590082373586]
  This research investigates the implementation of a real-time,-oriented dynamic pricing system for the travel sector. The system is designed to address factors such as demand, competitor pricing, and other external circumstances in real-time. Both controlled simulation and real-life application showed a respectable gain of 22% in revenue generation and a 17% improvement in pricing response time.
  arXiv  Detail & Related papers  (2024-11-03T17:24:02Z)
• A Primal-Dual Online Learning Approach for Dynamic Pricing of Sequentially Displayed Complementary Items under Sale Constraints [54.46126953873298]
  We address the problem of dynamically pricing complementary items that are sequentially displayed to customers. Coherent pricing policies for complementary items are essential because optimizing the pricing of each item individually is ineffective. We empirically evaluate our approach using synthetic settings randomly generated from real-world data, and compare its performance in terms of constraints violation and regret.
  arXiv  Detail & Related papers  (2024-07-08T09:55:31Z)
• Incremental Profit per Conversion: a Response Transformation for Uplift Modeling in E-Commerce Promotions [1.7640556247739623]
  This paper focuses on promotions with response-dependent costs, where expenses are incurred only when a purchase is made. Existing uplift model approaches often necessitate training multiple models, like meta-learners, or encounter complications when estimating profit. We introduce Incremental Profit per Conversion (IPC), a novel uplift measure of promotional campaigns' efficiency in unit economics.
  arXiv  Detail & Related papers  (2023-06-23T19:46:02Z)
• Resilient Constrained Learning [94.27081585149836]
  This paper presents a constrained learning approach that adapts the requirements while simultaneously solving the learning task. We call this approach resilient constrained learning after the term used to describe ecological systems that adapt to disruptions by modifying their operation.
  arXiv  Detail & Related papers  (2023-06-04T18:14:18Z)
• Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model [50.06663781566795]
  We consider a dynamic model with the consumers' preferences as well as price sensitivity varying over time. We measure the performance of a dynamic pricing policy via regret, which is the expected revenue loss compared to a clairvoyant that knows the sequence of model parameters in advance. Our regret analysis results not only demonstrate optimality of the proposed policy but also show that for policy planning it is essential to incorporate available structural information.
  arXiv  Detail & Related papers  (2023-03-28T00:23:23Z)
• When Do Curricula Work in Federated Learning? [56.88941905240137]
  We find that curriculum learning largely alleviates non-IIDness. The more disparate the data distributions across clients the more they benefit from learning. We propose a novel client selection technique that benefits from the real-world disparity in the clients.
  arXiv  Detail & Related papers  (2022-12-24T11:02:35Z)
• Augmented Bilinear Network for Incremental Multi-Stock Time-Series Classification [83.23129279407271]
  We propose a method to efficiently retain the knowledge available in a neural network pre-trained on a set of securities. In our method, the prior knowledge encoded in a pre-trained neural network is maintained by keeping existing connections fixed. This knowledge is adjusted for the new securities by a set of augmented connections, which are optimized using the new data.
  arXiv  Detail & Related papers  (2022-07-23T18:54:10Z)
• Model Distillation for Revenue Optimization: Interpretable Personalized Pricing [8.07517029746865]
  We present a customized, prescriptive tree-based algorithm that distills knowledge from a complex black-box machine learning algorithm. It segments customers with similar valuations and prescribes prices in such a way that maximizes revenue while maintaining interpretability.
  arXiv  Detail & Related papers  (2020-07-03T18:33:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.