IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v54y2025i2p297-323.html
   My bibliography  Save this article

Survival tree averaging by functional martingale-based residuals

Author

Listed:
  • Chang Wang
  • Baihua He
  • Shishun Zhao
  • Jianguo Sun
  • Xinyu Zhang

Abstract

A large literature has been established for random survival forest (RSF), a popular tool developed to analyze right-censored failure time data, under various situations. However, its prediction performance may not be optimal sometimes. To address this issue, we propose two optimal model averaging methods based on martingale residual processes. In particular, an in-of-bag and out-of-bag (IBOB) data process is defined, and two new IBOB functionals criteria are derived for the selection of weights. Furthermore, for their implementation, a greedy algorithm is presented, and the asymptotic optimality of the proposed model averaging approaches is established along with the convergence of the greedy averaging algorithms. Finally, an extensive simulation study is conducted, which indicates that the proposed methods work well, and an illustration is provided.

Suggested Citation

  • Chang Wang & Baihua He & Shishun Zhao & Jianguo Sun & Xinyu Zhang, 2025. "Survival tree averaging by functional martingale-based residuals," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(2), pages 297-323, January.
  • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:2:p:297-323
    DOI: 10.1080/03610926.2024.2309980
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2024.2309980?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:lstaxx:v:54:y:2025:i:2:p:297-323. 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/lsta .

    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.