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

Confidence Intervals for Sparse Penalized Regression With Random Designs

Author

Listed:
  • Guan Yu
  • Liang Yin
  • Shu Lu
  • Yufeng Liu

Abstract

With the abundance of large data, sparse penalized regression techniques are commonly used in data analysis due to the advantage of simultaneous variable selection and estimation. A number of convex as well as nonconvex penalties have been proposed in the literature to achieve sparse estimates. Despite intense work in this area, how to perform valid inference for sparse penalized regression with a general penalty remains to be an active research problem. In this article, by making use of state-of-the-art optimization tools in stochastic variational inequality theory, we propose a unified framework to construct confidence intervals for sparse penalized regression with a wide range of penalties, including convex and nonconvex penalties. We study the inference for parameters under the population version of the penalized regression as well as parameters of the underlying linear model. Theoretical convergence properties of the proposed method are obtained. Several simulated and real data examples are presented to demonstrate the validity and effectiveness of the proposed inference procedure. Supplementary materials for this article are available online.

Suggested Citation

  • Guan Yu & Liang Yin & Shu Lu & Yufeng Liu, 2020. "Confidence Intervals for Sparse Penalized Regression With Random Designs," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 115(530), pages 794-809, April.
  • Handle: RePEc:taf:jnlasa:v:115:y:2020:i:530:p:794-809
    DOI: 10.1080/01621459.2019.1585251
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/01621459.2019.1585251?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Joel L. Horowitz & Ahnaf Rafi, 2023. "Bootstrap based asymptotic refinements for high-dimensional nonlinear models," CeMMAP working papers 06/23, Institute for Fiscal Studies.

    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:115:y:2020:i:530:p:794-809. 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.