IDEAS home Printed from https://ideas.repec.org/a/spr/stpapr/v66y2025i3d10.1007_s00362-025-01678-x.html
   My bibliography  Save this article

Distributed penalizing function criterion for local polynomial estimation in nonparametric regression with massive data

Author

Listed:
  • Tianqi Sun

    (Shandong University)

  • Weiyu Li

    (Shandong University
    Shandong University)

  • Lu Lin

    (Shandong University
    Shandong University)

Abstract

The selection of bandwidth is one of the most important issues in local polynomial estimation. However, the related researches about data-driven bandwidth selection methodology in combination with divide-and-conquer (DC) strategy have still been rare in the existing literature, which is not feasible to support the application of local polynomial estimation for massive data sets. In this paper, as a development of traditional penalizing function criterion, we propose a distributed penalizing function (DPF) to achieve the selection of optimal bandwidth. The proposed DPF is computationally efficient for massive data sets and is shown to be “globally optimal” in the sense that the minimization of the DPF is asymptotically equivalent to the minimization of the true empirical loss of the averaged function estimator, i.e., the DC estimator. Besides, a novel algorithm is proposed to resolve the selection of bandwidth parameter with imbalance DC strategy. The performance of this DPF is presented in the simulation studies and the real data analysis.

Suggested Citation

  • Tianqi Sun & Weiyu Li & Lu Lin, 2025. "Distributed penalizing function criterion for local polynomial estimation in nonparametric regression with massive data," Statistical Papers, Springer, vol. 66(3), pages 1-26, April.
  • Handle: RePEc:spr:stpapr:v:66:y:2025:i:3:d:10.1007_s00362-025-01678-x
    DOI: 10.1007/s00362-025-01678-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00362-025-01678-x
    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/s00362-025-01678-x?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:stpapr:v:66:y:2025:i:3:d:10.1007_s00362-025-01678-x. 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.