IDEAS home Printed from https://ideas.repec.org/a/taf/jnlasa/v119y2024i546p1008-1018.html
   My bibliography  Save this article

A Random Projection Approach to Hypothesis Tests in High-Dimensional Single-Index Models

Author

Listed:
  • Changyu Liu
  • Xingqiu Zhao
  • Jian Huang

Abstract

In this article, we consider the problem of hypothesis testing in high-dimensional single-index models. First, we study the feasibility of applying the classical F-test to a single-index model when the dimension of covariate vector and sample size are of the same order, and derive its asymptotic null distribution and asymptotic local power function. For the ultrahigh-dimensional single-index model, we construct F-statistics based on lower-dimensional random projections of the data, and establish the asymptotic null distribution and the asymptotic local power function of the proposed test statistics for the hypothesis testing of global and partial parameters. The new proposed test possesses the advantages of having a simple structure as well as being easy to compute. We compare the proposed test with other high-dimensional tests and provide sufficient conditions under which the proposed tests are more efficient. We conduct simulation studies to evaluate the finite-sample performances of the proposed tests and demonstrate that it has higher power than some existing methods in the models we consider. The application of real high-dimensional gene expression data is also provided to illustrate the effectiveness of the method. Supplementary materials for this article are available online.

Suggested Citation

  • Changyu Liu & Xingqiu Zhao & Jian Huang, 2024. "A Random Projection Approach to Hypothesis Tests in High-Dimensional Single-Index Models," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 119(546), pages 1008-1018, April.
  • Handle: RePEc:taf:jnlasa:v:119:y:2024:i:546:p:1008-1018
    DOI: 10.1080/01621459.2022.2156350
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/01621459.2022.2156350?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:jnlasa:v:119:y:2024:i:546:p:1008-1018. 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/UASA20 .

    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.