ORBIT learns the (β-1)-smooth oracle price map via local polynomial approximation and bandit convex optimization in a semiparametric contextual pricing model, achieving regret Õ(T^{(2β-1)/(4β-3)} + √(dT)) with a matching lower bound for fixed d.
Operations Research , volume=
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3representative citing papers
A stagewise greedy algorithm for semiparametric contextual dynamic pricing achieves regret T to the max of 1/2 and 3 over (2 beta plus 1) for linear m, with a matching lower bound proving optimality.
citing papers explorer
-
Harnessing Unimodality in Semiparametric Contextual Pricing via Oracle Price Map Learning
ORBIT learns the (β-1)-smooth oracle price map via local polynomial approximation and bandit convex optimization in a semiparametric contextual pricing model, achieving regret Õ(T^{(2β-1)/(4β-3)} + √(dT)) with a matching lower bound for fixed d.
-
Optimal Semiparametric Dynamic Pricing with Feature Diversity
A stagewise greedy algorithm for semiparametric contextual dynamic pricing achieves regret T to the max of 1/2 and 3 over (2 beta plus 1) for linear m, with a matching lower bound proving optimality.
- Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness, and Safety