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

Sparsely restricted penalized estimators

Author

Listed:
  • Huseyin Guler
  • Ebru Ozgur Guler

Abstract

Parameters of a linear regression model might be estimated with Ordinary Least Squares (OLS). If there are linear restrictions on model parameters, it is possible to use Restricted Least Squares (RLS). Both OLS and RLS fail when the number of predictors is large and not suitable for model selection in a sparse model. In contrast to OLS and RLS, Least Absolute Shrinkage and Selection Operator (LASSO) and Bridge estimators perform well in sparse models and can be used for model selection and estimation, simultaneously. A Restricted LASSO (RLASSO) estimator is proposed in the literature recently but it doesn’t provide sparse solutions. In this paper, we propose new sparsely restricted penalized estimators called Sparsely Restricted LASSO (SRL) and Sparsely Restricted Bridge (SRB) based on RLASSO and Restricted Bridge (RBridge). We show that SRL and SRB produces sparse solutions while satisfying restrictions of model parameters. We compare aforementioned estimators with Monte Carlo simulations. We also use prostate cancer dataset that is widely used in the literature for a numerical application. Our comparisons show that SRL and SRB outperform the remaining estimators in terms of model selection performance and mean squared error.

Suggested Citation

  • Huseyin Guler & Ebru Ozgur Guler, 2021. "Sparsely restricted penalized estimators," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 50(7), pages 1656-1670, April.
  • Handle: RePEc:taf:lstaxx:v:50:y:2021:i:7:p:1656-1670
    DOI: 10.1080/03610926.2019.1682164
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2019.1682164?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:7:p:1656-1670. 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.