- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3(+1)
Read review
Paper summary
The paper studies online joint pricing and inventory optimization when demand depends on contextual features and sales are censored by stockouts. The retailer observes the context, chooses a price and inventory level, and subsequently observes sales, but cannot directly observe unmet demand. Consequently, realized profit is not fully observable, making conventional reward-based online learning difficult.
The authors propose Surrogate-Profit UCB (SP-UCB), a nonparametric contextual learning algorithm that combines inventory optimization, local context pooling, and optimistic price selection. Its central idea is to construct an observable surrogate reward from sales and leftover inventory. This surrogate preserves inventory comparisons at a fixed price but has a price-dependent bias. The authors correct this bias using a low-demand quantile that can be observed by choosing inventory appropriately.
The empirical evaluation uses synthetic demand environments, varying context dimension and smoothness. The paper also reports comparisons with context-agnostic implementations of existing online pricing and inventory methods, a twice-smooth price specialization, and a smoothness-mismatch study.
Critical strengths
S1. A meaningful problem with a clear technical challenge
The paper addresses an important interaction between pricing, inventory decisions, and censored feedback. Stocking decisions affect both profitability and the information available to the learner, so the problem is more involved than standard contextual pricing with directly observed rewards.The work makes a useful distinction between learning from incomplete demand observations and simply estimating a demand curve accurately. It seeks only the information required to make good decisions.
S2. An elegant surrogate-reward construction
The two-stage calibration argument is the paper's most compelling conceptual contribution. For price comparisons, the authors use a visible low quantile to remove the price-dependent offset. Under their location-shift demand model, this correction leaves a context-dependent constant that does not affect the optimal price. This is a strong structural insight: it avoids requiring full demand reconstruction or a separate high-inventory exploration phase.
S3. Joint treatment of learning and decision-making
SP-UCB combines several elements in a way tailored to the problem:
- Inventory profiling estimates near-optimal stocking levels.
- Coarser inventory-search grids reuse decisions across nearby prices.
- Kernel-weighted observations share information across nearby contexts.
- Upper confidence bounds encourage exploration of under-sampled prices.
The use of the second-order loss from inventory estimation near the optimal stocking level is particularly useful. It allows inventory learning to be less precise than price evaluation might otherwise require, reducing the burden of joint optimization.
Critical weaknesses
W1. The demand assumptions are restrictive
The analysis assumes a location-shift structure, , where the residual distribution can vary with context but does not vary with price within a context. This structure is central to the calibration argument: the low demand quantile shifts with price by the same amount as mean demand. In practical pricing applications, however, price changes can affect not only mean demand but also its variance, tail behavior, and customer composition. In those settings, the quantile correction may no longer remove the price-dependent bias.The paper acknowledges this limitation, but it remains a significant restriction on the scope of the results.
W2. Strong regularity and feasibility assumptions limit the covered settings
The model assumes smooth context dependence in both the demand location and residual distribution, bounded demand support, density bounds near relevant quantiles, and sufficient inventory capacity to keep the calibration and optimal inventory quantiles away from the action-space boundaries. These assumptions facilitate quantile estimation and inventory profiling, but they exclude potentially important cases, including irregular demand distributions, quantiles near support boundaries, and settings in which inventory capacity prevents the algorithm from exposing the calibration quantile. The analysis also assumes i.i.d. context-shock pairs and no inventory carryover.
W3. The empirical evaluation does not establish broad practical effectiveness
The experiments are synthetic, use five independent replications, and cover context dimensions of one and two over a limited set of smoothness levels and horizons.The appendix adds comparisons with two context-agnostic baselines—CWZ and a SALA-style method—on a contextual demand instance. These comparisons are informative, but they do not establish superiority over a strong contextual pricing-and-inventory method. In particular, the paper discusses Han et al. (2026a), a contextual approach using basis functions and an initial high-inventory exploration phase, but the reported comparison does not include an implementation of that method. The primary plots also show cumulative-regret scaling diagnostics rather than a direct empirical verification of minimax optimality. The authors themselves acknowledge that the fitted slopes do not establish worst-case asymptotic rates.
W4. The novelty relative to the closest prior work could be sharpened
The paper positions itself against several strands of work, particularly noncontextual censored pricing and inventory learning, contextual pricing with historical data, and the basis-function approach of Han et al. (2026a). The most convincing distinction is the combination of nonparametric contextual learning, a quantile-calibrated surrogate, and matching minimax rates without an initial phase designed to reveal demand through high inventory. However, the empirical evidence does not directly compare against the closest contextual baseline, and the paper could more explicitly separate which aspects of the contribution are fundamentally new from which extend established censored-inventory or contextual-bandit techniques.
Questions for authors
Q1. Robustness to price-dependent demand noise
The calibration identity relies on the residual distribution being independent of price within a context. Can the authors characterize a broader class of price-dependent residual distributions for which a similar observable surrogate remains valid? If not, can they explain why this restriction is essential rather than an artifact of the proposed construction?
Q2. Necessity of the quantile and feasibility assumptions
Which assumptions in Assumption 3 are required for identification of the optimal price and inventory, and which are needed only for the finite-sample regret analysis? In particular, can the method or its guarantees be extended when inventory capacity prevents the calibration quantile from being fully observable?
Q3. Comparison against contextual baselines
Why is the contextual method of Han et al. (2026a) not included in the experimental comparison? Can the authors provide a controlled comparison against this method or explain why a meaningful comparison is not possible?
Q4. Finite-horizon profiling overhead
How much of the regret is attributable to inventory profiling versus contextual price learning across the reported settings? Can the authors report profiling duration, the fraction of rounds spent profiling, and sensitivity to rare context cells?
9 comments
W3 and Q3. We added the contextual Han comparison and tested its dependence on the supplied representation.
Our adaptation of Han et al. (2026a, Algorithm 1) retains exploration, least-squares estimation, empirical residual estimation, and commitment. To match our problem, it removes carryover and uses feasible high inventory during exploration to reveal demand. It uses exploration rounds, an empirical budget choice rather than a reproduction of all theoretical constants.
In the nonlinear-interaction environment, , with five paired replications, common costs and feasible actions, and a common 801-price evaluation oracle. Han uses inventory 5 during exploration, 801 candidate prices, and features .
| Method | Cumulative regret, mean ± SE |
|---|---|
| SP-UCB | |
| CWZ | |
| SALA | |
| Han-adapted, linear |
SP-UCB reduces mean regret by 29.6% relative to the best tested comparator. CWZ and SALA pool contexts; the Han adaptation supplies the requested contextual comparator.
To separate algorithmic performance from representation choice, we also tested , with independent , , , and five replications. Han uses the same estimation and commitment procedure across dictionaries, exploration inventory 2.8, and 401 candidate prices; the evaluation oracle has 801 prices.
| Method | Cumulative regret, mean ± SE |
|---|---|
| SP-UCB | |
| Han-adapted, linear | |
| Han-adapted, quadratic | |
| Han-adapted, true cosine |
Both experiments use , , , and . SP-UCB uses , with and , respectively. Quadratic features already improve Han substantially without supplying the true cosine. A matched nonlinear mean-shape dictionary also outperforms SP-UCB in the dispersion experiment above. Performance depends materially on the supplied representation; no universal ranking follows. Our contribution is a guarantee over the stated nonparametric classes without specifying such a dictionary. Synthetic low-dimensional comparisons complement that guarantee; they do not establish broad deployment performance.
W4. Distinguishing the new contributions from established tools.
Kernel smoothing and UCB are established components. The new contribution is the quantile-calibrated price-comparison signal, its coupling with coarse inventory learning under endogenous censoring, and the matching regret bounds. The analysis jointly controls visibility, adaptive quantile estimation, localization, and profiling. It exploits locally quadratic inventory loss so that inventory accuracy supports price-value accuracy. Matching upper and lower bounds establish optimal polynomial regret orders for two price-regularity classes. We will make this separation explicit in the contribution statement.
The fixed-context inventory-error appendix isolates why this matters: SP has comparison error , while the analyzed CWZ Algorithm 2 correction includes a first-order term . With true profit gap and errors , , the respective population gaps are and . This identifies a concrete difference in how inventory error affects price comparisons at prescribed inventories; it is not a blanket ranking of complete policies.
Q4. Profiling costs are measured explicitly; unfinished rare cells do not block learning elsewhere.
Appendix K.2 (Table 6) reports phase-regret attribution across 665 original runs, including all 150 twice-smooth runs. For each trajectory, , using expected-profit gaps on the rounds assigned to each phase. The UCB term includes residual inventory loss. Representative five-run summaries are:
| Setting | Profiling rounds | Round share (%) | Regret share (%) |
|---|---|---|---|
| Nonlinear interaction, | |||
| Main, , , | |||
| Twice-smooth, , , |
Entries are means ± SE; percentage SEs are in percentage points. All cells complete profiling in these configurations. Profiling regret in the interaction experiment is . From to , the , profiling round share falls from 17.17% to 6.18% in the main experiment and from 13.09% to 5.23% in the twice-smooth experiment. Its finite-horizon regret contribution remains material. All use ; for main and otherwise.
The rare-context stress test adds 45 controlled runs (Appendix K.3, Figure 10). In a fixed , interior-optimum demand environment, each coordinate independently follows . We cross with and five paired seeds, keeping demand, costs, and algorithm parameters fixed (, ).
All cells finish in all 30 runs with or . At :
| Completed cells (%) | Unfinished cells' regret share (%) | Frequent-cell UCB rounds while other cells remain unfinished | |
|---|---|---|---|
| 8000 | |||
| 16000 | |||
| 32000 |
The frequent cell finishes in every run. Unfinished cells account for only 0.43%–0.57% of arrivals. Local profiling allows the frequent cell to learn while others remain unfinished, whose aggregate regret share is 2.65%–4.09% here. Their per-arrival losses can still be high. The partition grows from 9 to 16 cells at the last horizon, so completion percentages concern different partitions.
These observations directly answer the concern about rare cells delaying learning. They do not establish a regret advantage over an untested synchronous policy. Under this empirical tuning, nonvisibility averages 2.31%–8.29% at ; the experiment does not certify the theorem's visibility event. Full configuration and cell-level results are retained.
We thank the reviewer for the questions. Below we distinguish the assumptions' roles, establish the broader calibration condition, and provide the requested baseline and profiling evidence.
W1 and Q1. The demand restriction has established precedents, and exact calibration requires less than a location family.
Price-independent additive noise is an established specification in nonparametric pricing–inventory learning: see Petruzzi and Dada (1999), Chen, Chao, and Shi (2021, Section 2.1), and Chen, Wang, and Zhou (2024, Section 2.1). Our demand surface and context-dependent residual law are both unknown, with no finite-dimensional family imposed. Variance and shape may vary with context. Price invariance within a context restricts the class, but does not make its learning problem parametric or resolve endogenous censoring.
The broader class has an exact characterization (Appendix K.1, Eq. K.1). Write μx(p)=E[D∣x,p], let qρ,x(p) be a finite low quantile, and set O=minD,y and Y=(p+b)O−hc(y−O). For nonnegative, integrable demand,
=Q_x(p,y)+b\bigl[\mu_x(p)-q_{\rho,x}(p)\bigr].$$ For $b > 0$, the offset is price independent **exactly when $\mu_x(p)-q_{\rho,x}(p)=c(x)$**. Provided $y > q_{\rho,x}(p)$, this quantile is identifiable from sales. Other distributional features may depend on price. The displayed identity remains valid for general demand laws under the stated integrability conditions; arbitrary price-dependent residuals need not satisfy the price-independent-offset condition. Extending the full theorem additionally requires inventory, visibility, and estimation guarantees. **We also tested violations directly (Figure 9; complete comparison in Table 5).** Holding the nonlinear mean fixed, we used uniform residuals with radius $a_\gamma(p)=0.15[1+\gamma(2(p-0.1)/0.9-1)]$, for $\gamma\in\\{-0.75,-0.375,0,0.375,0.75\\}$. The four nonzero settings cover both dispersion directions; the extreme settings give a sevenfold standard-deviation ratio, with radii 0.0375–0.2625. At $T=16000$, with eight paired seeds and no parameter retuning, **calibration reduces true-profit regret by 6.2%–23.7% against the identical algorithm with calibration disabled, winning every paired comparison within every setting**. Thus its benefit survives these violations. The residual bias remains nonzero and empirical UCB nonvisibility is 6.5%–18.1%; this is finite-horizon evidence, not an extended regret theorem. **W2 and Q2. Identification assumptions and rate regularity must be assessed separately.** The relevant conditions serve distinct, explicit purposes: | Conditions | Role | |---|---| | Price-invariant mean-minus-quantile difference; visible calibration quantile | Identify a price-comparison signal from sales. | | Local density lower bounds; context Hölder/CDF regularity | Control quantile-estimation sensitivity and localization bias. | | Density upper bound; interior critical inventory | Make local inventory loss quadratic. | | Bounded support; capacity and quantile margins | Bound observations and ensure feasible inventories retain visibility despite estimation error. | These rate conditions have concrete precedents. [Chen, Chao, and Shi (2021, Section 2.5, Condition 4)](https://doi.org/10.1287/moor.2020.1084) require positive density near optimal quantiles, alongside strong concavity and higher-order demand smoothness. [Chen, Wang, and Zhou (2024, Assumption 1)](https://doi.org/10.1287/mnsc.2023.4859) use compact support and local density regularity. Our basic price-value class is Lipschitz, without global strong concavity. Hölder context regularity is standard in nonparametric contextual learning; see [Rigollet and Zeevi (2010, Section 2.2)](https://arxiv.org/abs/1003.1630). **We require no positive lower bound on context density.** These comparisons locate each assumption's role; they do not imply that the full model contains every earlier model. If capacity exceeds the calibration quantile but binds at the critical inventory, calibration can remain valid while our interior-inventory analysis needs modification. If capacity lies below the calibration quantile, feasible sales cannot expose that quantile, regardless of sample size. Lowering $\rho$ helps only if the new quantile is visible, regular, and satisfies the calibration relation. This is an identification constraint for the present estimator. Stationarity and no carryover define the current decision problem; temporal drift and carryover require additional analysis.