Kernel Assisted Learning for Personalized Dose Finding

• URL: http://arxiv.org/abs/2007.09811v1
• Date: Sun, 19 Jul 2020 23:03:26 GMT
• Title: Kernel Assisted Learning for Personalized Dose Finding
• Authors: Liangyu Zhu, Wenbin Lu, Michael R. Kosorok, Rui Song
• Abstract summary: An individualized dose rule recommends a dose level within a continuous safe dose range based on patient level information. In this article, we propose a kernel assisted learning method for estimating the optimal individualized dose rule.
• Score: 20.52632915107782
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An individualized dose rule recommends a dose level within a continuous safe dose range based on patient level information such as physical conditions, genetic factors and medication histories. Traditionally, personalized dose finding process requires repeating clinical visits of the patient and frequent adjustments of the dosage. Thus the patient is constantly exposed to the risk of underdosing and overdosing during the process. Statistical methods for finding an optimal individualized dose rule can lower the costs and risks for patients. In this article, we propose a kernel assisted learning method for estimating the optimal individualized dose rule. The proposed methodology can also be applied to all other continuous decision-making problems. Advantages of the proposed method include robustness to model misspecification and capability of providing statistical inference for the estimated parameters. In the simulation studies, we show that this method is capable of identifying the optimal individualized dose rule and produces favorable expected outcomes in the population. Finally, we illustrate our approach using data from a warfarin dosing study for thrombosis patients.

Related papers

• Likelihood Ratio Confidence Sets for Sequential Decision Making [51.66638486226482]
  We revisit the likelihood-based inference principle and propose to use likelihood ratios to construct valid confidence sequences. Our method is especially suitable for problems with well-specified likelihoods. We show how to provably choose the best sequence of estimators and shed light on connections to online convex optimization.
  arXiv  Detail & Related papers  (2023-11-08T00:10:21Z)
• 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)
• Safe and Interpretable Estimation of Optimal Treatment Regimes [54.257304443780434]
  We operationalize a safe and interpretable framework to identify optimal treatment regimes. Our findings support personalized treatment strategies based on a patient's medical history and pharmacological features.
  arXiv  Detail & Related papers  (2023-10-23T19:59:10Z)
• Reliable Off-Policy Learning for Dosage Combinations [27.385663284378854]
  Decision-making in personalized medicine must often make choices for dosage combinations. We propose a novel method for reliable off-policy learning for dosage combinations.
  arXiv  Detail & Related papers  (2023-05-31T11:08:43Z)
• Learning-Based sensitivity analysis and feedback design for drug delivery of mixed therapy of cancer in the presence of high model uncertainties [0.0]
  It is shown that dash-boards can be built in the 2D-space of the most influent state components that summarize the outcomes' probabilities and the associated drug usage as iso-values curves in the reduced state space. It is shown that dash-boards can be built in the 2D-space of the most influent state components that summarize the outcomes' probabilities and the associated drug usage as iso-values curves in the reduced state space.
  arXiv  Detail & Related papers  (2022-05-16T07:08:50Z)
• Policy Learning for Optimal Individualized Dose Intervals [3.9801611649762263]
  We propose a new method to estimate such a policy. We prove that our estimated policy is consistent, and its risk converges to that of the best-in-class policy at a root-nn rate.
  arXiv  Detail & Related papers  (2022-02-24T17:59:20Z)
• Optimal discharge of patients from intensive care via a data-driven policy learning framework [58.720142291102135]
  It is important that the patient discharge task addresses the nuanced trade-off between decreasing a patient's length of stay and the risk of readmission or even death following the discharge decision. This work introduces an end-to-end general framework for capturing this trade-off to recommend optimal discharge timing decisions. A data-driven approach is used to derive a parsimonious, discrete state space representation that captures a patient's physiological condition.
  arXiv  Detail & Related papers  (2021-12-17T04:39:33Z)
• Clinical Outcome Prediction from Admission Notes using Self-Supervised Knowledge Integration [55.88616573143478]
  Outcome prediction from clinical text can prevent doctors from overlooking possible risks. Diagnoses at discharge, procedures performed, in-hospital mortality and length-of-stay prediction are four common outcome prediction targets. We propose clinical outcome pre-training to integrate knowledge about patient outcomes from multiple public sources.
  arXiv  Detail & Related papers  (2021-02-08T10:26:44Z)
• Increasing the efficiency of randomized trial estimates via linear adjustment for a prognostic score [59.75318183140857]
  Estimating causal effects from randomized experiments is central to clinical research. Most methods for historical borrowing achieve reductions in variance by sacrificing strict type-I error rate control.
  arXiv  Detail & Related papers  (2020-12-17T21:10:10Z)
• Reinforcement learning and Bayesian data assimilation for model-informed precision dosing in oncology [0.0]
  Current strategies comprise model-informed dosing tables or are based on maximum a-posteriori estimates. We propose three novel approaches for MIPD employing Bayesian data assimilation and/or reinforcement learning to control neutropenia. These approaches have the potential to substantially reduce the incidence of life-threatening grade 4 and subtherapeutic grade 0 neutropenia.
  arXiv  Detail & Related papers  (2020-06-01T16:38:27Z)
• Contextual Constrained Learning for Dose-Finding Clinical Trials [102.8283665750281]
  C3T-Budget is a contextual constrained clinical trial algorithm for dose-finding under both budget and safety constraints. It recruits patients with consideration of the remaining budget, the remaining time, and the characteristics of each group.
  arXiv  Detail & Related papers  (2020-01-08T11:46:48Z)

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.