Near-optimal Individualized Treatment Recommendations

• URL: http://arxiv.org/abs/2004.02772v1
• Date: Mon, 6 Apr 2020 15:59:33 GMT
• Title: Near-optimal Individualized Treatment Recommendations
• Authors: Haomiao Meng, Ying-Qi Zhao, Haoda Fu, Xingye Qiao
• Abstract summary: individualized treatment recommendation (ITR) is an important analytic framework for precision medicine. We propose two methods to estimate the optimal A-ITR within the outcome weighted learning (OWL) framework. We show the consistency of these methods and obtain an upper bound for the risk between the theoretically optimal recommendation and the estimated one.
• Score: 9.585155938486048
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Individualized treatment recommendation (ITR) is an important analytic framework for precision medicine. The goal is to assign proper treatments to patients based on their individual characteristics. From the machine learning perspective, the solution to an ITR problem can be formulated as a weighted classification problem to maximize the average benefit that patients receive from the recommended treatments. Several methods have been proposed for ITR in both binary and multicategory treatment setups. In practice, one may prefer a more flexible recommendation with multiple treatment options. This motivates us to develop methods to obtain a set of near-optimal individualized treatment recommendations alternative to each other, called alternative individualized treatment recommendations (A-ITR). We propose two methods to estimate the optimal A-ITR within the outcome weighted learning (OWL) framework. We show the consistency of these methods and obtain an upper bound for the risk between the theoretically optimal recommendation and the estimated one. We also conduct simulation studies, and apply our methods to a real data set for Type 2 diabetic patients with injectable antidiabetic treatments. These numerical studies have shown the usefulness of the proposed A-ITR framework. We develop a R package aitr which can be found at https://github.com/menghaomiao/aitr.

Related papers

• An incremental preference elicitation-based approach to learning potentially non-monotonic preferences in multi-criteria sorting [53.36437745983783]
  We first construct a max-margin optimization-based model to model potentially non-monotonic preferences. We devise information amount measurement methods and question selection strategies to pinpoint the most informative alternative in each iteration. Two incremental preference elicitation-based algorithms are developed to learn potentially non-monotonic preferences.
  arXiv  Detail & Related papers  (2024-09-04T14:36:20Z)
• Revisiting Reciprocal Recommender Systems: Metrics, Formulation, and Method [60.364834418531366]
  We propose five new evaluation metrics that comprehensively and accurately assess the performance of RRS. We formulate the RRS from a causal perspective, formulating recommendations as bilateral interventions. We introduce a reranking strategy to maximize matching outcomes, as measured by the proposed metrics.
  arXiv  Detail & Related papers  (2024-08-19T07:21:02Z)
• The R.O.A.D. to precision medicine [5.877778007271621]
  We propose a prognostic stratum matching framework that addresses the deficiencies of Randomized trial data subgroup analysis. We apply our framework to observational data of patients with gastrointestinal stromal tumors (GIST) and validated the OPTs in an external cohort.
  arXiv  Detail & Related papers  (2023-11-03T03:08:15Z)
• Adaptive Semi-Supervised Inference for Optimal Treatment Decisions with Electronic Medical Record Data [18.77246683875067]
  The optimal treatment regime that yields the greatest overall expected clinical outcome of interest has attracted a lot of attention. We consider estimation of the optimal treatment regime with electronic medical record data under a semi-supervised setting.
  arXiv  Detail & Related papers  (2022-03-04T13:54:35Z)
• Conditional Generation Net for Medication Recommendation [73.09366442098339]
  Medication recommendation targets to provide a proper set of medicines according to patients' diagnoses, which is a critical task in clinics. We propose Conditional Generation Net (COGNet) which introduces a novel copy-or-predict mechanism to generate the set of medicines. We validate the proposed model on the public MIMIC data set, and the experimental results show that the proposed model can outperform state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-02-14T10:16:41Z)
• Choosing the Best of Both Worlds: Diverse and Novel Recommendations through Multi-Objective Reinforcement Learning [68.45370492516531]
  We introduce Scalarized Multi-Objective Reinforcement Learning (SMORL) for the Recommender Systems (RS) setting. SMORL agent augments standard recommendation models with additional RL layers that enforce it to simultaneously satisfy three principal objectives: accuracy, diversity, and novelty of recommendations. Our experimental results on two real-world datasets reveal a substantial increase in aggregate diversity, a moderate increase in accuracy, reduced repetitiveness of recommendations, and demonstrate the importance of reinforcing diversity and novelty as complementary objectives.
  arXiv  Detail & Related papers  (2021-10-28T13:22:45Z)
• CAPITAL: Optimal Subgroup Identification via Constrained Policy Tree Search [10.961093227672398]
  A clinically meaningful subgroup learning approach should identify the maximum number of patients who can benefit from the better treatment. We present an optimal subgroup selection rule (SSR) that maximizes the number of selected patients. We propose a ConstrAined PolIcy Tree seArch aLgorithm to find the optimal SSR within the interpretable decision tree class.
  arXiv  Detail & Related papers  (2021-10-11T22:41:07Z)
• Learning-based Computer-aided Prescription Model for Parkinson's Disease: A Data-driven Perspective [61.70045118068213]
  We build a dataset by collecting symptoms of PD patients, and their prescription drug provided by neurologists. Then, we build a novel computer-aided prescription model by learning the relation between observed symptoms and prescription drug. For the new coming patients, we could recommend (predict) suitable prescription drug on their observed symptoms by our prescription model.
  arXiv  Detail & Related papers  (2020-07-31T14:34:35Z)
• Learning Individualized Treatment Rules with Estimated Translated Inverse Propensity Score [29.606141542532356]
  In this paper, we focus on learning individualized treatment rules (ITRs) to derive a treatment policy. In our framework, we cast ITRs learning as a contextual bandit problem and minimize the expected risk of the treatment policy. As a long-term goal, our derived policy might eventually lead to better clinical guidelines for the administration of IV and VP.
  arXiv  Detail & Related papers  (2020-07-02T13:13:56Z)
• DTR Bandit: Learning to Make Response-Adaptive Decisions With Low Regret [59.81290762273153]
  Dynamic treatment regimes (DTRs) are personalized, adaptive, multi-stage treatment plans that adapt treatment decisions to an individual's initial features and to intermediate outcomes and features at each subsequent stage. We propose a novel algorithm that, by carefully balancing exploration and exploitation, is guaranteed to achieve rate-optimal regret when the transition and reward models are linear.
  arXiv  Detail & Related papers  (2020-05-06T13:03:42Z)
• Multicategory Angle-based Learning for Estimating Optimal Dynamic Treatment Regimes with Censored Data [12.499787110182632]
  An optimal treatment regime (DTR) consists of a sequence of decision rules in maximizing long-term benefits. In this paper, we develop a novel angle-based approach to target the optimal DTR under a multicategory treatment framework. Our numerical studies show that the proposed method outperforms competing methods in terms of maximizing the conditional survival function.
  arXiv  Detail & Related papers  (2020-01-14T05:19:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.