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

Group sparse sufficient dimension reduction: a model-free group variable selection method

Author

Listed:
  • Kaida Cai

    (Southeast University
    Southeast University)

  • Xuewen Lu

    (University of Calgary)

  • Hua Shen

    (University of Calgary)

Abstract

In many scientific applications, the covariates fall naturally into different groups, for example, the genes can be grouped by biological pathways in biological studies. In this study, we propose a new model-free group variable selection method by introducing a novel penalty, called adaptive group composite penalty. The proposed method can simultaneously achieve both sufficient dimension reduction and group variable selection in the case of diverging number of covariates. It can also simultaneously select important individual and group variables in a model-free fashion. An iterative two-stage algorithm is built to carry out the proposed method by reformulating the penalized objective functions. We provide the penalized sufficient dimension reduction estimators that estimate the targeted central subspace, and study their asymptotic properties. Simulation studies show that the proposed method gains significant efficiency in dimension reduction and variable selection, and it outperforms the other classical sparse sufficient dimension reduction methods in removing unimportant covariates, especially the unimportant groups. We illustrate the proposed method using a data set of RNA splicing signals.

Suggested Citation

  • Kaida Cai & Xuewen Lu & Hua Shen, 2025. "Group sparse sufficient dimension reduction: a model-free group variable selection method," Computational Statistics, Springer, vol. 40(5), pages 2323-2366, June.
  • Handle: RePEc:spr:compst:v:40:y:2025:i:5:d:10.1007_s00180-024-01547-5
    DOI: 10.1007/s00180-024-01547-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-024-01547-5
    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-01547-5?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-01547-5. 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.