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

Rates of convergence of the adaptive elastic net and the post-selection procedure in ultra-high dimensional sparse models

Author

Listed:
  • Yuehan Yang
  • Hu Yang

Abstract

This article studies the convergence rates of the adaptive elastic net and proposes a post-selection method. In the low dimensional settings, Zou and Zhou proved the variable selection consistency of the adaptive elastic net. In this article, we show the probability of the adaptive elastic net selecting the wrong variables decays at an exponential rate in the ultra-high dimensional setting. The Irrepresentable condition isn’t necessary according to some appropriate initial estimator. Furthermore, we show that the MSE and bias of the adaptive elastic net may lead to an inferior rate depending on the choice of the tuning parameters. We also prove that there exists a bias of asymptotic normality in the adaptive elastic net. Hence we propose a post-selection procedure, called SSLS (Separate Selection from Least Squares), to improve the bias problem of the adaptive elastic net. It is shown that the SSLS’s bias decays at an exponential rate and it is MSE decays to zero. The variable selection consistency of SSLS implies its asymptotic normality. We show by simulations and financial modeling that the SSLS performs better than the other oracle-like methods.

Suggested Citation

  • Yuehan Yang & Hu Yang, 2021. "Rates of convergence of the adaptive elastic net and the post-selection procedure in ultra-high dimensional sparse models," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 50(1), pages 73-94, January.
  • Handle: RePEc:taf:lstaxx:v:50:y:2021:i:1:p:73-94
    DOI: 10.1080/03610926.2019.1628991
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2019.1628991?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:50:y:2021:i:1:p:73-94. 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.