IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v211y2025ics0167947325001033.html
   My bibliography  Save this article

Distributed iterative hard thresholding for variable selection in Tobit models

Author

Listed:
  • Yang, Changxin
  • Zhu, Zhongyi
  • Lin, Hongmei
  • Fan, Zengyan
  • Lian, Heng

Abstract

While there is a substantial body of research on high-dimensional regression with left-censored responses, few methods address this problem in a distributed manner. Due to data transmission limitations and privacy concerns, centralizing all data is often impractical, necessitating a method for collaborative learning with distributed data. In this paper, we employ the Iterative Hard Thresholding (IHT) method for the Tobit model to address this challenge, allowing one to directly specify the desired sparsity and offering an alternative estimation and variable selection approach. Theoretical analysis shows that our estimator achieves a nearly minimax-optimal convergence rate using only a few rounds of communication. Its practical performance is evaluated under both the pooled and the distributed setting. The former highlights its competitive estimation efficiency and variable selection performance compared to existing approaches, while the latter demonstrates that the decentralized estimator closely matches the performance of its centralized counterpart. When applied to high-dimensional left-censored HIV viral load data, our method also demonstrates comparable performance.

Suggested Citation

  • Yang, Changxin & Zhu, Zhongyi & Lin, Hongmei & Fan, Zengyan & Lian, Heng, 2025. "Distributed iterative hard thresholding for variable selection in Tobit models," Computational Statistics & Data Analysis, Elsevier, vol. 211(C).
  • Handle: RePEc:eee:csdana:v:211:y:2025:i:c:s0167947325001033
    DOI: 10.1016/j.csda.2025.108227
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947325001033
    Download Restriction: Full text for ScienceDirect subscribers only.

    File URL: https://libkey.io/10.1016/j.csda.2025.108227?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.

    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:eee:csdana:v:211:y:2025:i:c:s0167947325001033. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    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.