mlsanityData to 7 Oct 2026

Convex Surrogate Loss Functions for Contextual Pricing with Transaction Data

arXiv 2202.10944 ↗First posted 16 Feb 2022cs.LG cs.IR stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

We study an off-policy contextual pricing problem where the seller has access to samples of prices that customers were previously offered, whether they purchased at that price, and auxiliary features describing the customer and/or item being sold. This is in contrast to the well-studied setting in which samples of the customer's valuation (willingness to pay) are observed. In our setting, the observed data is influenced by the previous pricing policy, and we do not know how customers would have responded to alternative prices. We introduce suitable loss functions for this setting that can be directly optimized to find an effective pricing policy with expected revenue guarantees, without the need for estimation of an intermediate demand function. We focus on convex loss functions. This is particularly relevant when linear pricing policies are desired for interpretability reasons, resulting in a tractable convex revenue optimization problem. We propose generalized hinge and quantile pricing loss functions that price at a multiplicative factor of the conditional expected valuation or a particular quantile of the prices that sold, despite the valuation data not being observed. We prove expected revenue bounds for these pricing policies respectively when the valuation distribution is log-concave, and we provide generalization bounds for the finite sample case. Finally, we conduct simulations on both synthetic and real-world data to demonstrate that this approach is competitive with, and in some settings outperforms, state-of-the-art methods in contextual pricing.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 99 references that are in the map. First posted on arXiv 16 Feb 2022.

Builds on

22 of 99 references.

References · 22

  1. 2021Convex optimizationcited by 2,479
  2. 2021Tabular Data: Deep Learning is Not All You Needcited by 530
  3. 2014From Predictive to Prescriptive Analyticscited by 142
  4. 2020Off-policy Bandits with Deficient Supportcited by 60
  5. 2018Policy Evaluation and Optimization with Continuous Treatmentscited by 57
  6. 2016Dynamic Pricing in High-dimensionscited by 55
  7. 2020Decision Trees for Decision-Making under the Predict-then-Optimize Frameworkcited by 52
  8. 2015The Sample Complexity of Revenue Maximizationcited by 48
  9. 2016Dynamic Pricing with Demand Covariatescited by 30
  10. 2017Optimization of Tree Ensemblescited by 26
  11. 2020Model Distillation for Revenue Optimization: Interpretable Personalized Pricingcited by 24
  12. 2017Revenue Optimization with Approximate Bid Predictionscited by 21
10 more
  1. 2015The Sample Complexity of Auctions with Side Informationcited by 20
  2. 2020Optimal Policy Treescited by 19
  3. 2013Learning Theory and Algorithms for Revenue Optimization in Second-Price Auctions with Reservecited by 16
  4. 2014Making the Most of Your Samplescited by 15
  5. 2020Contextual Reserve Price Optimization in Auctions via Mixed-Integer Programmingcited by 6
  6. 2021Model-Free Assortment Pricing with Transaction Datacited by 6
  7. 2021Loss Functions for Discrete Contextual Pricing with Observational Datacited by 6
  8. 2021Optimal Pricing with a Single Pointcited by 5
  9. 2018Are Two (Samples) Really Better Than One? On the Non-Asymptotic Performance of Empirical Revenue Maximizationcited by 4
  10. 2021Assortment Optimization under the Decision Forest Modelcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.