Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.32311

Doubly Robust Estimation under Covariate Dependent Censoring in Semi-Competing Risks Data

Jiyue Qin·Yuyao Wang·Ronghui Xu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Semi-competing risks occur when individuals may experience a non-terminal event and a terminal event, where the terminal event censors the non-terminal event but not vice versa. In the presence of covariate-dependent censoring, augmented inverse probability of censoring weighting (AIPCW) framework has not been developed for the special setting of semi-competing risks which, unlike competing risks, have asymmetric event time structure and complex estimands. Using semiparametric theory on coarsened data, we carefully develop an AIPCW framework for semi-competing risks. When treatment effects are of interest, we further integrate this approach with augmented inverse probability of treatment weighting (AIPTW), yielding a framework for estimating causal estimands under covariate-dependent censoring. The resulting estimators are shown to be doubly robust. Using the proposed framework, we estimate treatment specific risks of: i) non-terminal event, ii) terminal event without the non-terminal event, and iii) terminal event following the non-terminal event. We evaluate the finite sample performance through simulations, and apply the method to data from the Honolulu Asia Aging Study to assess the causal effects of midlife heavy drinking on late life cognitive impairment and mortality.

Explore related subjects

stat.ME

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiyue Qin, Yuyao Wang, Ronghui Xu. 2026-09-26. Doubly Robust Estimation under Covariate Dependent Censoring in Semi-Competing Risks Data. https://arxiv.org/abs/2609.32311

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Sample splitting for valid statistical inference in target trial emulations

\noindent Target trial emulation has improved comparative effectiveness research by making the causal question, assumptions, and analysis plan explicit. However, target trial protocols are usually developed iteratively. That is, after examining the data, investigators revise the protocol to reflect which target trials the observational data can realistically support. This iterative procedure is part of normal scientific practice, but it raises concerns about selective choices and invalid statistical inference. A simple procedure based on sample splitting addresses the concerns about valid inference. In the initial split, investigators can explore the data to define a target trial protocol. When these choices are made, the target trial protocol is implemented on the second split. Even though the investigators used the data to select the target trial protocol, the statistical inference has the usual coverage guarantees. The procedure intentionally mirrors how trialists move from pilot studies to a phase 3 trial. First, they use data from pilots and early-phase trials to decide on a final protocol. Then they implement this protocol and analyze a new set of data in a phase 3 trial.

stat.ME↗
arXiv2026

Rank Confidence Sequences:Anytime-valid Leaderboards

Leaderboards rank models by their average scores on benchmark items, and they are consulted repeatedly while the evaluation is still running. Existing confidence intervals for a model's rank control their error rate only if they are computed once, after a number of items chosen in advance. If they are recomputed as results arrive, and the evaluation stops once they look decisive, their error rate exceeds its nominal level. Anytime-valid methods keep their guarantees at all sample sizes simultaneously and hence under any stopping rule. They exist for the accuracy of one model, for one pair of models and for the set of models that may be best. For pairwise battles they also give ranks. None gives ranks when all models are scored on the same items, which makes their scores dependent. We construct rank confidence sequences: for every model, a set of ranks that contains its true rank, simultaneously for all models and at all times, at a chosen error level $α$, in finite samples. The construction combines betting e-processes, one for each ordered pair of models, with closed testing over the possible orderings of the models. It allows any dependence between the models' scores on an item. The method has two advantages. A leaderboard can be inspected after every item without inflating its error rate. The evaluation of each model can stop as soon as the question asked about it is answered, which saves compute. When results are examined only once, halfway through or later, little power is lost relative to fixed-sample methods. The paper quantifies these advantages in simulations and on public leaderboard data.

stat.ME↗
arXiv2026

Two-Point Dependent Wild Bootstrap for Weakly Dependent Estimating Equations

This paper develops a general two-point dependent wild bootstrap (DWB) for weakly dependent estimating equations. Its key feature is that the two-point marginal distribution and the latent serial dependence specification can be chosen separately. The construction combines a normalized two-point distribution with a stationary latent Gaussian process via a Gaussian copula transformation, includes dependent Rademacher and Mammen multipliers, and nests the classical iid two-point wild bootstrap as the serially independent case. The induced multiplier autocovariances determine the lag weights in a corresponding heteroskedasticity- and autocorrelation-consistent (HAC) covariance estimator, which coincides exactly with the conditional covariance of the bootstrap estimating-equation sum. We establish first-order bootstrap validity for asymptotically linear estimators by showing that the matched-HAC estimator consistently estimates the long-run covariance and that the bootstrap estimating-equation sum converges conditionally to the same Gaussian limit as its original-sample counterpart, yielding valid HAC-studentized $z$-tests and the corresponding Wald and Lagrange multiplier tests. Monte Carlo experiments in nonlinear generalized method of moments (GMM) and linear regression show that Rademacher DWB generally provides more accurate finite-sample size control for $z$-tests than the Mammen and Gaussian DWB. A GMM application to a nonlinear short-rate mean-reversion model illustrates the practical relevance of the proposed two-point DWB.

stat.ME↗