cs.LGMay 22, 2026

Human-in-the-Loop Contextual Bandits for Short-Term Rental Dynamic Pricing: Structural Equivalence of Historical Warm-Up and Approval-Gated Live Learning

Authors: Oleg Miroshnichenko

Abstract

Dynamic pricing in short-term rental (STR) markets presents a distinctive challenge for online learning algorithms: pricing decisions carry significant financial risk, operators require explainability, and market feedback is sparse (one booking outcome per listed night). We introduce the Human-in-the-Loop Gated Bandit (HITL-GB) framework, in which a contextual bandit algorithm generates price recommendations but a human agent retains authority to accept, modify, or reject each recommendation before it is applied. We show that under this approval constraint, historical pricing data -- collected under a prior deterministic policy -- is structurally equivalent to on-policy warm-up data for initialising the bandit's posterior, bypassing the weeks-to-months cold-start period that renders pure online bandit learning impractical in sparse-feedback markets. We formalise the approval-gated reward signal, derive a regularised ridge-regression warm-up procedure from historical episodes, and validate the approach on real STR production data (anonymised urban market, 2 rooms, April 2022 -- April 2026, 1,461 nightly pricing episodes). Our warm-up procedure compresses effective cold-start from ~150 episodes to ~30 episodes when initialising agents from the Hierarchical Factored Thompson Sampling (HF-TS) family. We further argue that the structural equivalence result is domain-agnostic: any high-stakes domain where human approval is legally or operationally required -- including clinical drug dosing, credit origination, content moderation, and radiological diagnosis -- satisfies the same conditions and benefits from the same warm-up strategy. In regulated industries, mandatory human oversight is thus a statistical asset rather than a deployment constraint.

Explore similar work

CardsList
May 7, 2026cs.LG

Optimal Contextual Pricing under Agnostic Non-Lipschitz Demand

We study contextual dynamic pricing with linear valuations and bounded-support agnostic noise, whose induced demand curve may be non-Lipschitz with arbitrary jumps and atoms. Such discontinuities break the cross-context interpolation arguments used by smooth-demand pricing algorithms, while the best previous method achieved only O~(T3/4)\tilde O(T^{3/4}) regret. We propose Conservative-Markdown Redirect-UCB Pricing, a polynomial-time algorithm that combines randomized parameter estimation, conservative residual-grid probing, and confidence-based one-step redirection. Our algorithm achieves O~(T2/3)\tilde O(T^{2/3}) optimal regret, matching the known lower bounds of Kleinberg and Leighton (2003) up to logarithmic factors and improving over the previous upper bound of Xu and Wang (2022). Under stochastic well-conditioned contexts, this closes the long-existing open regret gap in linear-valuation contextual pricing under agnostic non-Lipschitz noise distribution.
Jianyu Xu, Yu-Xiang Wang
PricesLinear RegretLipschitz Constant
AskPDF
Aug 4, 2026stat.ML

Minimax-Optimal Semiparametric Contextual Dynamic Pricing with Multimodal Revenue

We study contextual dynamic pricing with arbitrary covariate sequences and bounded, possibly nonbinary purchase quantities. Demand follows a semiparametric surplus-index model with an unknown linear valuation parameter and an unknown Hölder-smooth response. We impose neither concavity nor strong unimodality on revenue and allow nonunique optimal prices. We develop a pilot-corrected layered decision-partitioning policy that combines directional pilot estimation, local polynomial learning, predictable data assignment, and global action elimination. Pilot correction removes the first-order effect of valuation-parameter error, while permanent labels enable concentration under adaptive sampling. The policy attains the minimax smoothness-dependent horizon rate up to logarithmic factors; a matching lower bound already holds for a constant-context binary-demand subclass.
Xueping Gong, Zhuoluo Zhang, Zhaowei Miao +1
PricesOptimal PoliciesCovariate Shift
AskPDF
May 14, 2026stat.ML

Harnessing Unimodality in Semiparametric Contextual Pricing via Oracle Price Map Learning

We study contextual dynamic pricing in a semiparametric scalar-index valuation model where the latent value is vt=μ∗(ct)+ξtv_t=μ_\ast(\mathsf c_t)+ξ_t, with an unknown utility map μ∗μ_\ast and an unknown additive noise distribution. The key decision object is the one-dimensional oracle price map u↦p∗(u)u\mapsto p^\ast(u) induced by the scalar index u=μ∗(c)u=μ_\ast(\mathsf c) and the noise tail. Under the ββ-Hölder smoothness of the tail function for β≥2β\geq 2 and a revenue-geometry condition that gives a unique, stable, interior maximizer, this oracle map is itself (β−1)(β-1)-smooth. We exploit such structure through ORBIT\mathsf{ORBIT}, 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 μ∗(c)=c⊤θ∗μ_\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 O~(T2β−14β−3+dT)\widetilde{O}\big(T^{\frac{2β-1}{4β-3}}+\sqrt{dT}\big). For fixed dd, 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ölder utility.
Yingying Fan, Yuxuan Han, Jinchi Lv +2
PricesTest OraclesMap
AskPDF