IDEAS home Printed from https://ideas.repec.org/a/taf/tstfxx/v2y2018i1p80-88.html
   My bibliography  Save this article

Deep advantage learning for optimal dynamic treatment regime

Author

Listed:
  • Shuhan Liang
  • Wenbin Lu
  • Rui Song

Abstract

Recently deep learning has successfully achieved state-of-the-art performance on many difficult tasks. Deep neural networks allow for model flexibility and process features without the need of domain knowledge. Advantage learning (A-learning) is a popular method in dynamic treatment regime (DTR). It models the advantage function, which is of direct relevance to optimal treatment decision. No assumptions on baseline function are made. However, there is a paucity of literature on deep A-learning. In this paper, we present a deep A-learning approach to estimate optimal DTR. We use an inverse probability weighting method to estimate the difference between potential outcomes. Parameter sharing of convolutional neural networks (CNN) greatly reduces the amount of parameters in neural networks, which allows for high scalability. Convexified convolutional neural networks (CCNN) relax the constraints of CNN for optimisation purpose. Different architectures of CNN and CCNN are implemented for contrast function estimation. Both simulation results and application to the STAR*D (Sequenced Treatment Alternatives to Relieve Depression) trial indicate that the proposed methods outperform penalised least square estimator.

Suggested Citation

  • Shuhan Liang & Wenbin Lu & Rui Song, 2018. "Deep advantage learning for optimal dynamic treatment regime," Statistical Theory and Related Fields, Taylor & Francis Journals, vol. 2(1), pages 80-88, January.
  • Handle: RePEc:taf:tstfxx:v:2:y:2018:i:1:p:80-88
    DOI: 10.1080/24754269.2018.1466096
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24754269.2018.1466096
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24754269.2018.1466096?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:tstfxx:v:2:y:2018:i:1:p:80-88. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tstf .

    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.