IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1906.00198.html
   My bibliography  Save this paper

nprobust: Nonparametric Kernel-Based Estimation and Robust Bias-Corrected Inference

Author

Listed:
  • Sebastian Calonico
  • Matias D. Cattaneo
  • Max H. Farrell

Abstract

Nonparametric kernel density and local polynomial regression estimators are very popular in Statistics, Economics, and many other disciplines. They are routinely employed in applied work, either as part of the main empirical analysis or as a preliminary ingredient entering some other estimation or inference procedure. This article describes the main methodological and numerical features of the software package nprobust, which offers an array of estimation and inference procedures for nonparametric kernel-based density and local polynomial regression methods, implemented in both the R and Stata statistical platforms. The package includes not only classical bandwidth selection, estimation, and inference methods (Wand and Jones, 1995; Fan and Gijbels, 1996), but also other recent developments in the statistics and econometrics literatures such as robust bias-corrected inference and coverage error optimal bandwidth selection (Calonico, Cattaneo and Farrell, 2018, 2019). Furthermore, this article also proposes a simple way of estimating optimal bandwidths in practice that always delivers the optimal mean square error convergence rate regardless of the specific evaluation point, that is, no matter whether it is implemented at a boundary or interior point. Numerical performance is illustrated using an empirical application and simulated data, where a detailed numerical comparison with other R packages is given.

Suggested Citation

  • Sebastian Calonico & Matias D. Cattaneo & Max H. Farrell, 2019. "nprobust: Nonparametric Kernel-Based Estimation and Robust Bias-Corrected Inference," Papers 1906.00198, arXiv.org.
  • Handle: RePEc:arx:papers:1906.00198
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1906.00198
    File Function: Latest version
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Yi Zhang & Eli Ben-Michael & Kosuke Imai, 2022. "Safe Policy Learning under Regression Discontinuity Designs with Multiple Cutoffs," Papers 2208.13323, arXiv.org, revised Sep 2024.
    2. Chalak, Karim, 2024. "Nonparametric Gini-Frisch bounds," Journal of Econometrics, Elsevier, vol. 238(1).

    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:arx:papers:1906.00198. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.