English

Cost-optimal Sequential Testing via Doubly Robust Q-learning

Machine Learning 2026-04-16 v2 Artificial Intelligence Machine Learning Statistics Theory Statistics Theory

Abstract

Clinical decision-making often involves selecting tests that are costly, invasive, or time-consuming, motivating individualized, sequential strategies for what to measure and when to stop ascertaining. We study the problem of learning cost-optimal sequential decision policies from retrospective data, where test availability depends on prior results, inducing informative missingness. Under a sequential missing-at-random mechanism, we develop a doubly robust Q-learning framework for estimating optimal policies. The method introduces path-specific inverse probability weights that account for heterogeneous test trajectories and satisfy a normalization property conditional on the observed history. By combining these weights with auxiliary contrast models, we construct orthogonal pseudo-outcomes that enable unbiased policy learning when either the acquisition model or the contrast model is correctly specified. We establish oracle inequalities for the stage-wise contrast estimators, along with convergence rates, regret bounds, and misclassification rates for the learned policy. Simulations demonstrate improved cost-adjusted performance over weighted and complete-case baselines, and an application to a prostate cancer cohort study illustrates how the method reduces testing cost without compromising predictive accuracy.

Keywords

Cite

@article{arxiv.2604.11165,
  title  = {Cost-optimal Sequential Testing via Doubly Robust Q-learning},
  author = {Doudou Zhou and Yiran Zhang and Dian Jin and Yingye Zheng and Lu Tian and Tianxi Cai},
  journal= {arXiv preprint arXiv:2604.11165},
  year   = {2026}
}
R2 v1 2026-07-01T12:05:53.465Z