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

L0-regularization for high-dimensional regression with corrupted data

Author

Listed:
  • Jie Zhang
  • Yang Li
  • Ni Zhao
  • Zemin Zheng

Abstract

Corrupted data appears widely in many contemporary applications including voting behavior, high-throughput sequencing and sensor networks. In this article, we consider the sparse modeling via L0-regularization under the framework of high-dimensional measurement error models. By utilizing the techniques of the nearest positive semi-definite matrix projection, the resulting regularization problem can be efficiently solved through a polynomial algorithm. Under some interpretable conditions, we prove that the proposed estimator can enjoy comprehensive statistical properties including the model selection consistency and the oracle inequalities. In particular, the nonoptimality of the logarithmic factor of dimensionality will be showed in the oracle inequalities. We demonstrate the effectiveness of the proposed method by simulation studies.

Suggested Citation

  • Jie Zhang & Yang Li & Ni Zhao & Zemin Zheng, 2024. "L0-regularization for high-dimensional regression with corrupted data," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(1), pages 215-231, January.
    • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:1:p:215-231
    DOI: 10.1080/03610926.2022.2076125
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2022.2076125
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2022.2076125?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:53:y:2024:i:1:p:215-231. 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.