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

Rates of convergence of the constrained least squares estimator in high-dimensional monotone single-index models

Author

Listed:
  • Christopher Fragneau
  • Fadoua Balabdaoui
  • Cécile Durot
  • Skander Stefan

Abstract

In the high-dimensional monotone single index model, one observes i.i.d. copies of (X,Y) where the real response variable Y is linked to the d-dimensional covariate X through the relationship E[Y|X]=Ψ0(α0TX) almost surely, where the dimension d is allowed to grow with the sample size. The index parameter α0∈ℝd and the monotone ridge function Ψ0 are both unknown. The main focus of the article is to compute convergence rates of the least squares estimator (LSE) of the bundled regression function g0=Ψ0(α0T⋅) under the constraints that Ψ0 is monotone and α0 belongs to a certain set 𝒮. Special attention is paid to the case where 𝒮 describes sparsity constraints on α0, that is when 𝒮 is the set of vectors in ℝd whose number of non zero components does not exceed some threshold. Our results cover also the case of a misspecified model, when α0∉𝒮. Since the LSE of the index is computationally expensive for large d, we have implemented a forward selection algorithm, which runs much faster, for the case of sparcity constraints. Simulations indicate that the forward selection estimator (for both the index parameter and monotone ridge function) is a quite satisfactory alternative in the situation of sparsity.

Suggested Citation

  • Christopher Fragneau & Fadoua Balabdaoui & Cécile Durot & Skander Stefan, 2025. "Rates of convergence of the constrained least squares estimator in high-dimensional monotone single-index models," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(4), pages 1180-1204, February.
  • Handle: RePEc:taf:lstaxx:v:54:y:2025:i:4:p:1180-1204
    DOI: 10.1080/03610926.2024.2330673
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2024.2330673?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:4:p:1180-1204. 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.