IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v40y2025i5d10.1007_s00180-024-01562-6.html
   My bibliography  Save this article

A fast divide-and-conquer strategy for single-index model with massive data

Author

Listed:
  • Na Li

    (Hunan Normal University)

  • Jing Yang

    (Hunan Normal University)

Abstract

With the rapid development of modern technology, massive data has received widespread attention. Constrained by computer performance, traditional statistical analysis methods are difficult to obtain quantitative analysis results of massive data. Currently, the most popular analytical method for massive data is the divide-and-conquer(DC) strategy, but relevant studies rarely mention the fitting of semiparametric models under massive data. In this paper, we combine the ideas of DC and refined outer product gradient (rOPG) to propose DC-lsrOPG and DC-qrOPG methods for analyzing massive data for single-index models, based on least squares regression and quantile regression, respectively. The newly developed method significantly reduces the amount of main memory required and running time. The asymptotic normality of the proposed method has been established under some mild conditions. The resulting estimators are theoretically as efficient as the traditional rOPG estimators on the entire data. Some simulation studies and a real data analysis are conducted to illustrate the finite sample performance of the proposed methods.

Suggested Citation

  • Na Li & Jing Yang, 2025. "A fast divide-and-conquer strategy for single-index model with massive data," Computational Statistics, Springer, vol. 40(5), pages 2367-2387, June.
    • Handle: RePEc:spr:compst:v:40:y:2025:i:5:d:10.1007_s00180-024-01562-6
    DOI: 10.1007/s00180-024-01562-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-024-01562-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00180-024-01562-6?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:spr:compst:v:40:y:2025:i:5:d:10.1007_s00180-024-01562-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.