IDEAS home Printed from https://ideas.repec.org/a/oup/biomet/v108y2021i3p643-659..html
   My bibliography  Save this article

A parsimonious personalized dose-finding model via dimension reduction

Author

Listed:
  • Wenzhuo Zhou
  • Ruoqing Zhu
  • Donglin Zeng

Abstract

SummaryLearning an individualized dose rule in personalized medicine is a challenging statistical problem. Existing methods often suffer from the curse of dimensionality, especially when the decision function is estimated nonparametrically. To tackle this problem, we propose a dimension reduction framework that effectively reduces the estimation to an optimization on a lower-dimensional subspace of the covariates. We exploit the fact that the individualized dose rule can be defined in a subspace spanned by a few linear combinations of the covariates to obtain a more parsimonious model. Owing to direct maximization of the value function, the proposed framework does not require the inverse probability of the propensity score under observational studies. This distinguishes our approach from the outcome-weighted learning framework, which also solves decision rules directly. Within the same framework, we further propose a pseudo-direct learning approach that focuses more on estimating the dimensionality-reduced subspace of the treatment outcome. Parameters in both approaches can be estimated efficiently using an orthogonality-constrained optimization algorithm on the Stiefel manifold. Under mild regularity assumptions, results on the asymptotic normality of the proposed estimators are established. We also derive the consistency and convergence rate of the value function under the estimated optimal dose rule. We evaluate the performance of the proposed approaches through extensive simulation studies and analysis of a pharmacogenetic dataset.

Suggested Citation

  • Wenzhuo Zhou & Ruoqing Zhu & Donglin Zeng, 2021. "A parsimonious personalized dose-finding model via dimension reduction," Biometrika, Biometrika Trust, vol. 108(3), pages 643-659.
  • Handle: RePEc:oup:biomet:v:108:y:2021:i:3:p:643-659.
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1093/biomet/asaa087
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cai, Hengrui & Shi, Chengchun & Song, Rui & Lu, Wenbin, 2023. "Jump interval-learning for individualized decision making with continuous treatments," LSE Research Online Documents on Economics 118231, London School of Economics and Political Science, LSE Library.

    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:oup:biomet:v:108:y:2021:i:3:p:643-659.. 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: Oxford University Press (email available below). General contact details of provider: https://academic.oup.com/biomet .

    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.