arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.00973cs.LGstat.ML

Learning to search efficiently for causally near-optimal treatments

Chalmers University of Technology(查尔姆斯理工大学);University of Gothenburg(哥德堡大学);Harvard University(哈佛大学);Brown University(布朗大学)

Samuel Håkansson, Viktor Lindblom, Omer Gottesman, Fredrik D. Johansson

英文摘要:

Finding an effective medical treatment often requires a search by trial and error. Making this search more efficient by minimizing the number of unnecessary trials could lower both costs and patient suffering. We formalize this problem as learning a policy for finding a near-optimal treatment in a minimum number of trials using a causal inference framework. We give a model-based dynamic programming algorithm which learns from observational data while being robust to unmeasured confounding. To reduce time complexity, we suggest a greedy algorithm which bounds the near-optimality constraint. The methods are evaluated on synthetic and real-world healthcare data and compared to model-free reinforcement learning. We find that our methods compare favorably to the model-free baseline while offering a more transparent trade-off between search time and treatment efficacy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑