IDEAS home Printed from https://ideas.repec.org/a/bla/jorssc/v68y2019i2p289-308.html
   My bibliography  Save this article

gBOIN: a unified model‐assisted phase I trial design accounting for toxicity grades, and binary or continuous end points

Author

Listed:
  • Rongji Mu
  • Ying Yuan
  • Jin Xu
  • Sumithra J. Mandrekar
  • Jun Yin

Abstract

The landscape of oncology drug development has recently changed with the emergence of molecularly targeted agents and immunotherapies. These new therapeutic agents appear more likely to induce multiple low or moderate grade toxicities rather than dose limiting toxicities. Various model‐based dose finding designs and toxicity severity scoring systems have been proposed to account for toxicity grades, but they are difficult to implement because of the use of complicated dose–toxicity models and the requirement to refit the model at each decision of dose escalation and de‐escalation. We propose a generalized Bayesian optimal interval design, gBOIN, that accommodates various existing toxicity grade scoring systems under a unified framework. As a model‐assisted design, gBOIN derives its optimal decision rule on the basis of the exponential family of distributions but is carried out in a simple way as the algorithm‐based design: its decision of dose escalation and de‐escalation involves only a simple comparison of the sample mean of the end point with two prespecified dose escalation and de‐escalation boundaries. No model fitting is needed. We show that gBOIN has the desirable finite property of coherence and a large sample property of consistency. Numerical studies show that gBOIN yields good performance that is comparable with or superior to that of some existing, more complicated model‐based designs. A Web application for implementing gBOIN is freely available from http://www.trialdesign.org.

Suggested Citation

  • Rongji Mu & Ying Yuan & Jin Xu & Sumithra J. Mandrekar & Jun Yin, 2019. "gBOIN: a unified model‐assisted phase I trial design accounting for toxicity grades, and binary or continuous end points," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 68(2), pages 289-308, February.
  • Handle: RePEc:bla:jorssc:v:68:y:2019:i:2:p:289-308
    DOI: 10.1111/rssc.12263
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/rssc.12263
    Download Restriction: no

    File URL: https://libkey.io/10.1111/rssc.12263?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:jorssc:v:68:y:2019:i:2:p:289-308. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/rssssea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.