mlsanityData to 14 Oct 2026

Harnessing Unimodality in Semiparametric Contextual Pricing via Oracle Price Map Learning

arXiv 2605.15411 ↗First posted 14 May 2026stat.ML cs.LG math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

We study contextual dynamic pricing in a semiparametric scalar-index valuation model where the latent value is vt=μ_ast(mathsf ct)+xit, with an unknown utility map μ_ast and an unknown additive noise distribution. The key decision object is the one-dimensional oracle price map umapsto p^ast(u) induced by the scalar index u=μ_ast(mathsf c) and the noise tail. Under the β-H"older smoothness of the tail function for β≥ 2 and a revenue-geometry condition that gives a unique, stable, interior maximizer, this oracle map is itself (β-1)-smooth. We exploit such structure through mathsfORBIT, a modular coarse-to-fine policy that takes a scalar pilot index as input, localizes a benchmark price in each active bin, and learns a local polynomial approximation of the oracle map inside a trust region via bandit convex optimization. For the baseline linear utility model μ_ast(mathsf c)=mathsf c^topθ_ast, an adaptive elliptical exploration scheme constructs the required scalar pilot online without distributional assumptions on the contexts. The resulting policy achieves regret widetildeObig(T^frac2β-14β-3+√dTbig). For fixed d, we establish a matching lower bound in the horizon dependence, unveiling that the nonparametric oracle-map learning term is minimax sharp. The same scalar-pilot interface also yields extensions to sparse high-dimensional linear utility and nonparametric H"older utility.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 5 of its 48 references that are in the map. First posted on arXiv 14 May 2026.

Builds on

5 of 48 references.

References · 5

  1. 2024Bandit Convex Optimisationcited by 19
  2. 2024Online Newton Method for Bandit Convex Optimisationcited by 12
  3. 2024Dynamic Contextual Pricing with Doubly Non-Parametric Random Utility Modelscited by 6
  4. 2025Dynamic Pricing in the Linear Valuation Model using Shape Constraintscited by 4
  5. 2025Revenue Maximization Under Sequential Price Competition Via The Estimation Of s-Concave Demand Functionscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.