IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v40y2025i3d10.1007_s00180-024-01525-x.html
   My bibliography  Save this article

A novel nonconvex, smooth-at-origin penalty for statistical learning

Author

Listed:
  • Majnu John

    (Hofstra University
    Hofstra/Zucker School of Medicine)

  • Sujit Vettam

    (University of Chicago)

  • Yihren Wu

    (Hofstra University)

Abstract

Nonconvex penalties are utilized for regularization in high-dimensional statistical learning algorithms primarily because they yield unbiased or nearly unbiased estimators for the parameters in the model. Nonconvex penalties existing in the literature such as SCAD, MCP, Laplace and arctan have a singularity at origin which makes them useful also for variable selection. However, in several high-dimensional frameworks such as deep learning, variable selection is less of a concern. In this paper, we present a nonconvex penalty which is smooth at origin. The paper includes asymptotic results for ordinary least squares estimators regularized with the new penalty function, showing asymptotic bias that vanishes exponentially fast. We also conducted simulations to better understand the finite sample properties and conducted an empirical study employing deep neural network architecture on three datasets and convolutional neural network on four datasets. The empirical study based on artificial neural networks showed better performance for the new regularization approach in five out of the seven datasets.

Suggested Citation

  • Majnu John & Sujit Vettam & Yihren Wu, 2025. "A novel nonconvex, smooth-at-origin penalty for statistical learning," Computational Statistics, Springer, vol. 40(3), pages 1397-1422, March.
  • Handle: RePEc:spr:compst:v:40:y:2025:i:3:d:10.1007_s00180-024-01525-x
    DOI: 10.1007/s00180-024-01525-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-024-01525-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00180-024-01525-x?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.

    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:spr:compst:v:40:y:2025:i:3:d:10.1007_s00180-024-01525-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.