skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Optimal Stopping of Adaptive Dose-Finding Trials
The primary objective of this paper is to develop computationally efficient methods for optimal stopping of an adaptive Phase II dose-finding clinical trial, where the decision maker may terminate the trial for efficacy or abandon it as a result of futility. We develop two solution methods and compare them in terms of computational time and several performance metrics such as the probability of correct stopping decision. One proposed method is an application of the one-step look-ahead policy to this problem. The second proposal builds a diffusion approximation to the state variable in the continuous regime and approximates the trial’s stopping time by optimal stopping of a diffusion process. The secondary objective of the paper is to compare these methods on different dose-response curves, particularly when the true dose-response curve has no significant advantage over a placebo. Our results, which include a real clinical trial case study, show that look-ahead policies perform poorly in terms of the probability of correct decision in this setting, whereas our diffusion approximation method provides robust solutions.  more » « less
Award ID(s):
1651912
PAR ID:
10209407
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Service Science
Volume:
12
Issue:
2-3
ISSN:
2164-3962
Page Range / eLocation ID:
80 to 99
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, Service Science)
    A key and challenging step toward personalized/precision medicine is the ability to redesign dose-finding clinical trials. This work studies a problem of fully response-adaptive Bayesian design of phase II dose-finding clinical trials with patient information, where the decision maker seeks to identify the right dose for each patient type (often defined as an effective target dose for each group of patients) by minimizing the expected (over patient types) variance of the right dose. We formulate this problem by a stochastic dynamic program and exploit a few properties of this class of learning problems. Because the optimal solution is intractable, we propose an approximate policy by an adaptation of a one-step look-ahead framework. We show the optimality of the proposed policy for a setting with homogeneous patients and two doses and find its asymptotic rate of sampling. We adapt a number of commonly applied allocation policies in dose-finding clinical trials, such as posterior adaptive sampling, and test their performance against our proposed policy via extensive simulations with synthetic and real data. Our numerical analyses provide insights regarding the connection between the structure of the dose-response curve for each patient type and the performance of allocation policies. This paper provides a practical framework for the Food and Drug Administration and pharmaceutical companies to transition from the current phase II procedures to the era of personalized dose-finding clinical trials. Funding: This research is supported by the National Science Foundation [Grant 1651912]. Supplemental Material: The online appendices are available at https://doi.org/10.1287/serv.2022.0306 . 
    more » « less
  2. ; (, Naval Research Logistics (NRL))
    Abstract We study the classical ranking and selection problem, where the ultimate goal is to find the unknown best alternative in terms of the probability of correct selection or expected opportunity cost. However, this paper adopts an alternative sampling approach to achieve this goal, where sampling decisions are made with the objective of maximizing information about the unknown best alternative, or equivalently, minimizing its Shannon entropy. This adaptive learning is formulated via a Bayesian stochastic dynamic programming problem, by which several properties of the learning problem are presented, including the monotonicity of the optimal value function in an information‐seeking setting. Since the state space of the stochastic dynamic program is unbounded in the Gaussian setting, a one‐step look‐ahead approach is used to develop a policy. The proposed policy seeks to maximize the one‐step information gain about the unknown best alternative, and therefore, it is called information gradient (IG). It is also proved that the IG policy is consistent, that is, as the sampling budget grows to infinity, the IG policy finds the true best alternative almost surely. Later, a computationally efficient estimate of the proposed policy, called approximated information gradient (AIG), is introduced and in the numerical experiments its performance is tested against recent benchmarks alongside several sensitivity analyses. Results show that AIG performs competitively against other algorithms from the literature. 
    more » « less
  3. ; ; (, Pharmaceutical Statistics)
    Abstract We review some simulation‐based methods to implement optimal decisions in sequential design problems as they naturally arise in clinical trial design. As a motivating example we use a stylized version of a dose‐ranging design in the ASTIN trial. The approach can be characterized as constrained backward induction. The nature of the constraint is a restriction of the decisions to a set of actions that are functions of the current history only implicitly through a low‐dimensional summary statistic. In addition, the action set is restricted to time‐invariant policies. Time‐dependence is only introduced indirectly through the change of the chosen summary statistic over time. This restriction allows computationally efficient solutions to the sequential decision problem. A further simplification is achieved by restricting optimal actions to be described by decision boundaries on the space of such summary statistics. 
    more » « less
  4. ; (, INFORMS Journal on Computing)
    Identifying the right dose is one of the most important decisions in drug development. Adaptive designs are promoted to conduct dose-finding clinical trials as they are more efficient and ethical compared with static designs. However, current techniques in response-adaptive designs for dose allocation are complex and need significant computational effort, which is a major impediment for implementation in practice. This study proposes a Bayesian nonparametric framework for estimating the dose-response curve, which uses a piecewise linear approximation to the curve by consecutively connecting the expected mean response at each dose. Our extensive numerical results reveal that a first-order Bayesian nonparametric model with a known correlation structure in prior for the expected mean response performs competitively when compared with the standard approach and other more complex models in terms of several relevant metrics and enjoys computational efficiency. Furthermore, structural properties for the optimal learning problem, which seeks to minimize the variance of the target dose, are established under this simple model. Summary of Contribution: In this work, we propose a methodology to derive efficient patient allocation rules in response-adaptive dose-finding clinical trials, where computational issues are the main concern. We show that our methodologies are competitive with the state-of-the-art methodology in terms of solution quality, are significantly more computationally efficient, and are more robust in terms of the shape of the dose-response curve, among other parameter changes. This research fits in “the intersection of computing and operations research” as it adapts operations research techniques to produce computationally attractive solutions to patient allocation problems in dose-finding clinical trials. 
    more » « less
  5. ; ; (, Journal of the Royal Statistical Society Series C: Applied Statistics)
    Summary A sequentially adaptive Bayesian design is presented for a clinical trial of cord-blood-derived natural killer cells to treat severe haematologic malignancies. Given six prognostic subgroups defined by disease type and severity, the goal is to optimize cell dose in each subgroup. The trial has five co-primary outcomes: the times to severe toxicity, cytokine release syndrome, disease progression or response and death. The design assumes a multivariate Weibull regression model, with marginals depending on dose, subgroup and patient frailties that induce association between the event times. Utilities of all possible combinations of the non-fatal outcomes over the first 100 days following cell infusion are elicited, with posterior mean utility used as a criterion to optimize the dose. For each subgroup, the design stops accrual to doses having an unacceptably high death rate and at the end of the trial selects the optimal safe dose. A simulation study is presented to validate the design's safety, ability to identify optimal doses and robustness, and to compare it with a simplified design that ignores patient heterogeneity. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email