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

A unified class of penalties with the capability of producing a differentiable alternative to l1 norm penalty

Author

Listed:
  • Hamed Haselimashhadi

Abstract

This article presents a class of novel penalties that are defined under a unified framework, which includes lasso, SCAD and ridge as special cases, and novel functions, such as the asymmetric quantile check function. The proposed class of penalties is capable of producing alternative differentiable penalties to lasso. We mainly focus on this case and show its desirable properties, propose an efficient algorithm for the parameter estimation and prove the theoretical properties of the resulting estimators. Moreover, we exploit the differentiability of the penalty function by deriving a novel Generalized Information Criterion (GIC) for model selection. The method is implemented in the R package DLASSO freely available from CRAN, http://CRAN.R-project.org/package=DLASSO.

Suggested Citation

  • Hamed Haselimashhadi, 2019. "A unified class of penalties with the capability of producing a differentiable alternative to l1 norm penalty," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 48(22), pages 5530-5545, November.
    • Handle: RePEc:taf:lstaxx:v:48:y:2019:i:22:p:5530-5545
    DOI: 10.1080/03610926.2018.1515362
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2018.1515362
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2018.1515362?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:48:y:2019:i:22:p:5530-5545. 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.