基于非贪婪树学习的连续剂量动态治疗决策规则估计
Non-greedy Tree-based Learning for Estimating Global Optimal Dynamic Treatment Decision Rules with Continuous Treatment Dosage
摘要:
动态治疗方案(DTR)在精准医疗中发挥着关键作用,在多个阶段分配患者特定的治疗并优化长期临床结果。然而,大多数关于DTR的现有工作都集中在分类治疗方案上,而不是连续治疗方案。此外,规则黑箱机器学习方法和规则树学习方法的性能分别缺乏可解释性和全局最优性。在本文中,我们提出了一种非贪婪的全局优化方法的剂量搜索,即全局最优剂量树为基础的学习方法(GoDoTree),它结合了稳健估计的反事实的结果意味着一个可解释的和非贪婪的决策树估计的全局最优动态剂量治疗方案,在多阶段设置。GoDoTree-Learning递归地估计反事实结果均值如何依赖于在每个阶段使用双重鲁棒估计器的连续治疗剂量,并以非贪婪的方式优化特定于阶段的决策树。我们进行模拟研究,以评估所提出的方法的有限样本性能,并将其应用到一个真实的数据应用程序的最佳华法林剂量发现。
英文摘要:
Dynamic treatment regime (DTR) plays a critical role in precision medicine when assigning patient-specific treatments at multiple stages and optimizing a long term clinical outcome. However, most of existing work about DTRs have been focused on categorical treatment scenarios, instead of continuous treatment options. Also, the performances of regular black-box machine learning methods and regular tree learning methods are lack of interpretability and global optimality respectively. In this paper, we propose a non-greedy global optimization method for dose search, namely Global Optimal Dosage Tree-based learning method (GoDoTree), which combines a robust estimation of the counterfactual outcome mean with an interpretable and non-greedy decision tree for estimating the global optimal dynamic dosage treatment regime in a multiple-stage setting. GoDoTree-Learning recursively estimates how the counterfactual outcome mean depends on a continuous treatment dosage using doubly robust estimators at each stage, and optimizes the stage-specific decision tree in a non-greedy way. We conduct simulation studies to evaluate the finite sample performance of the proposed method and apply it to a real data application for optimal warfarin dose finding.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。