- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies statistical inference for prespecified linear functionals in low-rank tensor bandits, focusing on individual arm means and differences between two arm means. The proposed RITE algorithm combines tensor elimination in fixed spectral coordinates with target-specific exploration, while updating a low-rank nuisance estimator through capped inverse-propensity-weighted Riemannian regression. Its inference module constructs a one-step correction using the tangent space determined at the start of each batch and accounts for adaptive sampling through inverse-propensity ratios. Under the stated regularity conditions, the authors establish a low-rank estimation error bound and asymptotic normality, together with an additional target-exploration regret cost of order . Validation includes synthetic regret and coverage experiments, component ablations, and a simulated online environment constructed from advertising data.
Critical strengths
-
The paper addresses a meaningful distinction between low-regret decision-making and valid statistical inference. In particular, elimination can leave a prespecified suboptimal arm with insufficient subsequent observations. This provides a clear statistical motivation for target-specific exploration.
-
The integration of the decision and inference modules is well motivated. Keeping target-exploration observations outside the tensor-elimination decision state makes their additional regret cost transparent. Fixing the tangent space and correction direction at the beginning of each batch also supports a predictable score construction and a martingale analysis. These design choices provide a reasonable foundation for the proposed approach.
Critical weaknesses
-
The connection between the proposed sampling policy and the conditions required for valid inference is not sufficiently established. Theorem 1 relies on local restricted curvature of the weighted design, sufficient effective information, and optimization iterates remaining in a stable neighborhood. Theorem 2 additionally requires negligible remainders, variance stabilization, variance-estimator consistency, and a Lindeberg condition. The supplement provides further sufficient conditions and remainder bounds, but it remains unclear in which explicit regime of dimensions, ranks, horizon, and exploration parameters RITE itself guarantees these requirements jointly. In particular, sufficient information for the specified target does not imply sufficient information in all directions needed to estimate the low-rank nuisance tensor. Section S.3.2 explicitly retains the need for an additional policy-coverage argument. This leaves an important gap in establishing the combined inferential and regret guarantees for the proposed algorithm.
-
The benefit of the low-rank inference machinery over simpler alternatives is not sufficiently demonstrated. Since RITE explicitly samples the target arms and knows their sampling probabilities, informative comparisons would include estimators based directly on target-exploration observations and suitable IPW or augmented-IPW estimators accounting for adaptive sampling. The existing regret baselines do not establish whether tangent-space correction yields shorter, well-calibrated intervals at comparable regret. Moreover, the main regret and coverage experiments use different exploration strengths and initialization configurations; coverage is primarily evaluated under exact null constraints; and the advertising experiment adds Gaussian noise to an empirical reward tensor. These results provide preliminary support, but do not sufficiently establish the joint benefit under one operating configuration or clarify sensitivity to departures from the low-rank model.
Overall, the problem is worthwhile, but substantial uncertainty remains about the attainability of the theoretical conditions and the incremental value of the proposed inference procedure.
Questions for authors
-
Clarification of the theoretical guarantees: Can the authors provide an explicit parameter regime in which RITE's actual sampling policy jointly satisfies the restricted-information conditions and the inferential product-rate conditions in the supplement? In particular, what growth rate of can be guaranteed when and the propensity cap is fixed?
-
Validation of the inferential benefit: Under the same sampling policy, observations, and regret cost, how much does low-rank debiasing improve interval length and coverage relative to direct target-exploration estimators and suitable IPW or augmented-IPW baselines? Can coverage, interval length, and regret be reported jointly under one RITE configuration?
-
Clarification of the scope of the current claims: Where are a prespecified target, exact Tucker rank, and fixed-horizon inference essential to the analysis? If the reward tensor is only approximately low-rank, what additional bias remains in the debiasing expansion, and how is this issue assessed in the advertising experiment? I do not require future extensions such as data-dependent target selection or anytime-valid inference, but the distinction between established guarantees and unsupported use cases should be explicit.
6 comments
Therefore, the restricted-information and inferential conditions are jointly satisfied by an explicit configuration of RITE’s actual sampling policy. For fixed tensor dimensions, the warm-up and target-exploration costs remain , preserving sublinear regret under the existing regret regularity conditions.
Response to Q2:
We thank the reviewer for this suggestion. To isolate the benefit of low-rank debiasing, we have added a controlled comparison of RITE with direct target-arm estimation, stabilized IPW, and augmented IPW using the same low-rank Tucker estimator (AIPW) in Section S.1.6 (Lines 937–966, Table S7) of the supplementary material. The additions are highlighted in red in the revised manuscript, and the results are also presented below.
All methods use exactly the same adaptive RITE sampling policy, observations, and cumulative regret within each target experiment. The experimental configuration is fixed at , Tucker rank , , , , and , with uniform warm-up and four Riemannian steps per batch. The configuration was selected using independent pilot runs and evaluated over 250 new Monte Carlo replications. Each prespecified target uses its corresponding RITE exploration policy.
Table 1. Inferential comparison under identical RITE sampling trajectories (nonzero targets).
| Target | Method | Coverage | Length | RMSE | Regret |
|---|---|---|---|---|---|
| Entry | RITE | 95.2% | 0.04908 | 0.01272 | 11,495.53 |
| Direct-target | 94.0% | 0.05544 | 0.01429 | 11,495.53 | |
| IPW | 94.8% | 0.05742 | 0.01513 | 11,495.53 | |
| AIPW | 96.0% | 0.05848 | 0.01495 | 11,495.53 | |
| Gap | RITE | 94.4% | 0.08896 | 0.02333 | 11,185.37 |
| Direct-target | 92.8% | 0.10680 | 0.02669 | 11,185.37 | |
| IPW | 94.0% | 0.10935 | 0.02848 | 11,185.37 | |
| AIPW | 95.6% | 0.11312 | 0.02833 | 11,185.37 | |
From the results presented in Table 1, we observe that RITE achieves near-nominal coverage with the shortest confidence intervals and lowest RMSE for both targets. Relative to AIPW, RITE reduces average interval length by 16.1% for entry inference and 21.4% for reward-gap inference. Compared with direct target-arm estimation, the reductions are 11.5% and 16.7%, respectively.
The corresponding zero-target experiments exhibit the same pattern, with RITE attaining 94.8–97.2% coverage and reducing interval length by 17.5–22.9% relative to AIPW.
These results demonstrate the benefit of exploiting shared low-rank information across arms, particularly when direct observations of the inferential target are sparse. Importantly, these gains are achieved without any additional regret cost relative to the other estimators, since all methods share the same RITE decision trajectories.
Response to Q3:
Below, we clarify the scope of our inferential guarantees in (1), characterize the additional bias under approximate low-rank structure in (2), assess sensitivity through a rank-misspecification experiment in (3), and further examine this issue in the real-world advertising experiment in Point (4).
(1). Scope and practical relevance of the assumptions. Our inference framework focuses on a target , a fixed Tucker-rank model, and pointwise confidence intervals at a fixed horizon.The target is specified before online sampling because it determines the reference distribution and the target-specific exploration policy. This does not require prior knowledge of the optimal action or the true tensor factors. The Tucker rank determines the low-rank manifold and its tangent space, which are central to the debiasing construction. In practice, the rank can be estimated from exploratory warm-up observations using mode-wise singular-value thresholding or validation-based selection, and then fixed for subsequent inference. The theoretical guarantees apply when the specified rank correctly describes the underlying tensor structure.
The fixed-horizon formulation provides pointwise asymptotic coverage for a specified target. Confidence intervals evaluated at multiple checkpoints are interpreted pointwise rather than as simultaneous confidence sequences.
(2). Additional bias under approximate low-rank structure. Suppose the true reward tensor admits the decomposition $ \mathcal T^\star=\mathcal T_r+\mathcal E, $ where has Tucker rank and is the approximation residual.
Substituting this decomposition into RITE’s batch-wise one-step estimator yields the additional residual contribution $ { B_{{\rm app},k}(H) = -\langle\mathcal E,H\rangle + \frac1{n_k} \sum_{t\in\mathcal E_k} \rho_t^H (g_{H,k}^{\top}s_{I_t}^{(k)}) \mathcal E_{I_t}. } $ Using the target-reference identity the predictable component of this residual is
The first term represents the approximation error in the target functional, while the second captures the portion corrected by the target-reference score. The difference characterizes the structural bias remaining after one-step debiasing.
More explicitly, by Cauchy–Schwarz and the definition of , $ \begin{aligned} |\overline B_{{\rm app},k}(H)| \leq{}& \|\mathcal E\|_F\|H\|_F\ + \sqrt{ h_{k-1}(H)^\top J_{H,k}^{\dagger} h_{k-1}(H) } \,\|\mathcal E\|_{q_H}, \end{aligned} $ where $ \|\mathcal E\|_{q_H}^2 = \sum_iq_H(i)\mathcal E_i^2. $ Under the existing target-information bound, this gives
Thus, the residual structural bias is controlled by the approximation error and its alignment with the inferential target. The one-step correction can partially cancel this error, but does not generally eliminate it. A sufficient requirement for negligible structural bias is that its aggregated contribution be . The stronger condition $ \|\mathcal E\|_F=o(v_T(H)^{1/2}) $ also ensures this under bounded target-information constants, together with the corresponding nuisance-estimation and variance conditions. This identifies the scale at which approximate low-rank structure preserves the original inferential approximation.
(3). Empirical sensitivity to Tucker-rank misspecification. To assess the sensitivity highlighted in the reviewer’s weakness, we conducted an additional experiment with true Tucker rank and fitted ranks , , and .
We used , , , , a fixed warm-up of 400 rounds, and 60 independent replications with paired environment seeds. The table reports nominal 95% confidence interval coverage, average interval length, and RMSE for entry and reward-gap targets.
Table 2. Sensitivity of RITE inference to Tucker-rank misspecification
| Fitted rank | Target | Coverage | Length | RMSE |
|---|---|---|---|---|
| Entry | 0.1435 | 0.0561 | ||
| Entry | 0.0442 | 0.0153 | ||
| Entry | 0.0543 | 0.0181 | ||
| Gap | 0.2059 | 0.0823 | ||
| Gap | 0.0588 | 0.0172 | ||
| Gap | 0.0730 | 0.0205 | ||
Note: Entry and Gap denote inference on a prespecified action’s expected reward and the expected reward difference between two prespecified actions, respectively. Fitted rank ( the Tucker rank assumed by RITE); the true Tucker rank .
The results in Table 2 show that the correctly specified rank achieves near-nominal coverage with the shortest intervals and lowest RMSE. Rank underestimation increases estimation error and reduces coverage, particularly for reward-gap inference, while moderate overestimation maintains near-nominal coverage with somewhat wider intervals.
These findings illustrate how misspecification affects the complete RITE decision-inference procedure and complement the theoretical residual-bias characterization above.
(4). Interpretation of the advertising experiment. We thank the reviewer for this valuable suggestion. To strengthen the empirical evaluation, we have replaced the previous semi-synthetic experiment with a real-data experiment using the publicly available Outbrain Click Prediction dataset, with empirical rewards derived from actual impressions and click outcomes. We have updated Section 6, Figure 4, and Supplementary Section S.2 accordingly. Using the dataset's advertising and event information, we construct a third-order empirical reward tensor of size , indexed by advertiser, publisher, and day of week, with 1,176 possible actions.
We compare RITE against Tensor Elimination, Tensor Epoch-Greedy, Matricized ESTR-style, and Vectorized UCB over rounds and 30 independent runs. The final mean cumulative regrets are 1,845.2 for Tensor Elimination, 1,949.9 for RITE, 4,936.5 for Tensor Epoch-Greedy, 5,363.1 for Matricized ESTR-style, and 7,641.4 for Vectorized UCB.
Response to Q1 (Question1):
We thank the reviewer for raising this question. We have provided an explicit parameter regime in Section S.3.2 (Lines 1201–1254) and Section S.6.3 (Lines 1910–2000) of the supplementary material, under which RITE’s implemented sampling policy jointly satisfies the restricted-information conditions and the inferential product-rate conditions. We have also clarified the guaranteed effective-information growth under a fixed propensity cap. These additions are highlighted in red in the revised manuscript. Below, we provide further explanations.
(1)Information growth under a fixed propensity cap. Let P=∏j=1dpj. By construction, RITE employs the mixture policy $ \pi_t(i)=(1-\varepsilon_t)\mathbf 1\{i=I_t^{\rm TE}\}+\varepsilon_t q_H(i), \qquad q_H(i)\geq\frac{\eta}{P}, $ with εt=min1/2,cε(t∨s0)−1/2. For fixed πmin>0, the capped-IPW design satisfies $ \begin{aligned} &\mathbb E\!\left[ \omega_t^{\rm lr} \langle\Delta,\mathcal A_t\rangle^2 \mid\mathcal F_{t-1}\right]\ =\sum_i \frac{\pi_t(i)}{\pi_t(i)\vee\pi_{\min}} \Delta_i^2\ \geq \min\left\{1,\frac{\eta\varepsilon_t}{P\pi_{\min}}\right\} \|\Delta\|_F^2. \end{aligned} $ Moreover, since ωtlr≥1, the realized information is bounded below by the minimum number of target-exploration visits across actions. Concentration of these exploration counts yields, with high probability, Nkeff=Ωp(tk+1−s0) for fixed dimensions and sufficiently large post-warm-up exploration counts.
Thus, RITE guarantees growing effective information even when tensor elimination concentrates on promising actions. This establishes the guaranteed growth rate under a fixed propensity cap.
(2)An explicit joint parameter regime. To verify the complete restricted-information conditions, consider fixed tensor dimensions and Tucker ranks, with the regularity conditions of Theorem 1 and Appendix S.3.2. We retain RITE’s original exploration schedule and choose πmin(T)=2PTηcε, $ s_0\asymp\sqrt{T}[\log(pT)]^2,$ $ 2^{k_0-1}\asymp T^{7/8}.$
The propensity threshold is selected before sampling and remains fixed throughout the horizon. The warm-up length can be implemented using the existing initialization rule through a horizon-dependent cinit(T). For sufficiently large T, this choice ensures πt(i)≥πmin(T) for every action. Hence, the capped-IPW weight coincides with ordinary IPW, and E![ωtlr⟨Δ,At⟩2∣Ft−1]=∣Δ∣F2.
Consequently, the predictable restricted-information conditions in Appendix S.3.2 hold with Nk=tk+1−1,Cri=1. Applying the restricted-curvature concentration result in Appendix S.5 gives $ { N_k^{\rm eff}\asymp t_{k+1}-1 } $ with high probability, uniformly over started batches.
(3)Verification of the inferential product-rate conditions. For an explicit sufficient inferential setting, additionally suppose that the optimal action is unique with a fixed positive reward gap, the prespecified nonzero entry or reward-gap target excludes the optimal action, and the noise is conditionally homoscedastic. We retain the local initialization, optimization-accuracy, and spectral-rotation conditions of the existing theoretical analysis. Under the phase-confidence and elimination results in Appendix S.7, the active set contracts to the optimal action before inference begins, with probability tending to one. The selected burn-in satisfies tk0≍pT7/8, while NTinf∼pT. Since dT=O(Tlog(pT)), Theorem 1 and the tangent-space perturbation bound yield maxk≥k0−1(rk+ηk)=Op(T−3/16logT). For completed inference batches, nkεk≳T3/8≫Deff+log(pT). Substituting these rates into the checkable product-rate condition in Appendix S.6.3 gives $ \mathrm{Rem}_{\rm product}(H) = O_p(T^{-3/8}\log T). $ Under the specified target and noise conditions, the predictable inferential variance satisfies vT(H)≍T−1/2, so $ { T^{-3/8}\log T =o(T^{-1/4}) =o\bigl(v_T(H)^{1/2}\bigr) }, $ where the last equality indicates the inferential standard-error scale. The terminal short-batch contribution is likewise negligible; moreover, the maximal leverage satisfies $ \mathcal L_T(H)=O_p(T^{-1/4})\to0, $ and the nuisance-error contribution to the variance estimator vanishes. These verify the inferential remainder, leverage, and variance-consistency requirements of Appendix S.6 under the stated sufficient regime.