Approximation Methods for Determining Optimal Allocations in Response Adaptive Clinical Trials

Vishal Ahuja, John R. Birge, Christopher Ryan

Abstract

Clinical trials have traditionally followed a fixed design, in which patient allocation to treatments is fixed throughout the trial and specified in the protocol. The primary goal of this static design is to learn about the efficacy of treatments. Response-adaptive designs, where assignment to treatments evolves as patient outcomes are observed, are gaining in popularity due to potential for improvements in cost and efficiency over traditional designs. Such designs can be modeled as a Bayesian adaptive Markov decision process (BAMDP). Given the forward-looking nature of the underlying algorithms which solve BAMDP, the problem size grows as the trial becomes larger or more complex, often exponentially, making it computationally challenging to find an optimal solution. In this study, we propose grid-based approximation to reduce the computational burden. The proposed methods also open the possibility of implementing adaptive designs to large clinical trials. Further, we use numerical examples to demonstrate the effectiveness of our approach, including the effects of changing the number of observations and the grid resolution.

References

  1. Adelman, D. and Mersereau, A. J. (2008). Relaxations of weakly coupled stochastic dynamic programs. Operations Research, 56(3):712727.
  2. Ahuja, V. and Birge, J. (2014). Fully adaptive designs for clinical trials: Simultaneous learning from multiple patients. Working paper available at SSRN: http://ssrn.com/abstract=2126906.
  3. Aviv, Y. and Pazgal, A. (2005). A partially observed markov decision process for dynamic pricing. Management Science, 51(9):14001416.
  4. Berry, D. (1978). Modified two-armed bandit strategies for certain clinical trials. Journal of the American Statistical Association, 73(362):pp. 339345.
  5. Berry, D. and Fristedt, B. (1985). Bandit problems: sequential allocation of experiments. Chapman and Hall London.
  6. Bertsimas, D. and Mersereau, A. (2007). A learning approach for interactive marketing to a customer segment. Operations Research, 55(6):11201135.
  7. Caro, F. and Gallien, J. (2007). Dynamic assortment with English, R., Lebovitz, Y., Griffin, R., et al. (2010). Transforming Clinical Research in the United States: Challenges and Opportunities: Workshop Summary. National Academies Press.
  8. Forbes (2013). The cost of creating a new drug now 5 billion, pushing big pharma to change.
  9. Hauskrecht, M. (1997). Incremental methods for computing bounds in partially observable markov decision processes. In Proceedings of The National Conference on Artificial Intelligence, pages 734739. Citeseer.
  10. Judd, K. (1998). Numerical Methods in Economics. The MIT press.
  11. Lovejoy, W. (1991). Computationally feasible bounds for partially observed markov decision processes. Operations research, 39(1):162175.
  12. Monahan, G. (1982). State of the arta survey of partially observable markov decision processes: Theory, models, and algorithms. Management Science, 28(1):116.
  13. Powell, W. (2007). Approximate Dynamic Programming: Solving the curses of dimensionality. WileyInterscience.
  14. Sandikci, B. (2010). Reduction of a pomdp to an mdp. Wiley Encyclopedia of Operations Research and Management Science.
  15. Sandikci, B., Maillart, L. M., Schaefer, A. J., and Roberts, M. S. (2013). Alleviating the patients price of privacy through a partially observable waiting list. Management Science.
  16. Zhou, R. and Hansen, E. (2001). An improved grid-based approximation algorithm for pomdps. In International Joint Conference on Artificial Intelligence, volume 17, pages 707716. Citeseer
Download


Paper Citation


in Harvard Style

Ahuja V., R. Birge J. and Ryan C. (2014). Approximation Methods for Determining Optimal Allocations in Response Adaptive Clinical Trials . In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 460-465. DOI: 10.5220/0004909504600465


in Bibtex Style

@conference{icores14,
author={Vishal Ahuja and John R. Birge and Christopher Ryan},
title={Approximation Methods for Determining Optimal Allocations in Response Adaptive Clinical Trials},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={460-465},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004909504600465},
isbn={978-989-758-017-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Approximation Methods for Determining Optimal Allocations in Response Adaptive Clinical Trials
SN - 978-989-758-017-8
AU - Ahuja V.
AU - R. Birge J.
AU - Ryan C.
PY - 2014
SP - 460
EP - 465
DO - 10.5220/0004909504600465