Simulations and RNA-seq breast cancer data analyses demonstrate that CRT* substantially improves power while maintaining type-I error control in heterogeneous settings.
Abstract
The conditional randomization test (CRT) provides a principled approach to conditional independence (CI) testing, guaranteeing exact type-I error control when the true conditional distribution is known. In practice, however, this distribution must be estimated, and estimation errors can inflate type-I errors, while high dimensionality and limited sample sizes can reduce power. Although external and unlabeled data offer the potential to improve CI testing, naive integration that ignores distributional heterogeneity can compromise type-I error control and fail to enhance power. We propose \textbf{CRT*}, a novel framework that robustly integrates external and unlabeled datasets to enhance CI testing in heterogeneous scenarios. CRT* employs smooth residual-bootstrap (SRB) with transfer learning for conditional distribution estimation, combined with adaptive data fusion via an optimal convex combination of test statistics. We theoretically establish that the SRB-based estimator converges to the true conditional distribution in expected total variation distance. Furthermore, even in high-dimensional regimes, CRT* maintains valid type-I error control and achieves strictly higher power than standard CRT without external data. Simulations and RNA-seq breast cancer data analyses demonstrate that CRT* substantially improves power while maintaining type-I error control in heterogeneous settings.
We develop a marginal coordinate test for regression with Euclidean predictors and a random-object response in a separable metric space. The goal is to test whether a predictor provides additional information about the response conditional on the remaining predictors. In a semi-supervised design, an unlabeled sample is...
Jia-Ye Chen, Rui Qiu, Roulin Wang et al.· 0 citations
We investigate Empirical Bayes (EB) methods in the context of compound adaptive experiments, where the arm distribution in each experiment follows a normal distribution with an unknown mean that we seek to estimate. There are two main EB strategies: $g$-modeling, which estimates the prior by maximizing the marginal lik...
Karun Adusumilli, Jia-Ying Gu, J. Tao· 0 citations
This work exploits the Rockafellar–Uryasev representation to formulate both contextual CVaR estimation and optimization as optimization problems involving conditional expectations, and develops a unified data-driven predict-then-optimize framework.
Heng Luo, Ni-Fei Lin, L. J. Hong· Asia-Pacific Journal of Oper...· 0 citations
Reinforcement learning and contextual bandit algorithms have become increasingly common in sequential decision-making applications. When these methods are deployed in high-stakes domains, there is growing interest not only in learning effective policies, but also in conducting statistical inference for quantities learn...
James Leiner, Aurélien F. Bibaut, Nathan Kallus et al.· 0 citations
High-dimensional two-sample mean testing is challenging when the dimension exceeds the sample size. The random projection method proposed by Lopes et al. (2011) addresses this difficulty by mapping the data to a lower dimension space where Hotelling's $T^2$ statistic can be applied, while retaining useful covariance in...
Yan-Yan Ouyang, Ru-Xin Peng, Wangli Xu et al.· 0 citations
In the classical normal means problem, independent train--test folds can be constructed by perturbing the data with normal randomization. Averaging over $K$ such folds yields a cross-validation estimator whose bias depends on the marginal distribution of the randomization variables, while its variance depends on their...
S. Chattopadhyay, Si-Fan Liu, Snigdha Panigrahi· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.