IDEAS home Printed from https://ideas.repec.org/p/tin/wpaper/20260023.html

Barron-Loss Adaptive Estimation

Author

Listed:
  • Ramon F. A. de Punder

    (University of Amsterdam)

  • Mathijs R. G. Dijkstra

    (University of Amsterdam)

  • Cees G. H. Diks

    (University of Amsterdam)

Abstract

The score-driven framework relies on pre-specified scoring rules tied to assumed conditional densities, making it vulnerable to misspecification under outliers or structural breaks. We embed the flexible Barron loss within the quasi score-driven (QSD) framework, allowing the degree of robustness to be learned from the data. The resulting Barron-Loss Adaptive Estimation (BLADE) filter generates a strictly stationary, ergodic, and invertible sequence of time-varying parameters under mild regularity conditions. Within an extended quasi score-driven estimation framework, obtained by generalizing the required moment condition, the associated estimator is shown to be consistent and asymptotically normal. The Barron loss is strictly consistent for a family of functionals indexed by the shape parameter γ, enabling smooth adaptation between classical and robust targets. We establish that the BLADE update belongs to the clas of Proper and Robust Autoregressive Derivative Adaptive (PRADA) models and is therefore expected divergence reducing. We further establish that more robust updates achieve an at least as large expected local divergence reduction as less robust ones over explicit intervals, of step sizes in a non-contaminated setting and of contamination proportions under a contaminated updating draw, providing a formal robustness guarantee against corrupted observations. Monte Carlo experiments under non-contaminated and contaminated estimation environments confirm these theoretical findings and demonstrate superior performance relative to GARCH and βt–GARCH models when outliers are present.

Suggested Citation

  • Ramon F. A. de Punder & Mathijs R. G. Dijkstra & Cees G. H. Diks, 2026. "Barron-Loss Adaptive Estimation," Tinbergen Institute Discussion Papers 26-023/III, Tinbergen Institute, revised 05 Jun 2026.
  • Handle: RePEc:tin:wpaper:20260023
    as

    Download full text from publisher

    File URL: https://papers.tinbergen.nl/26023.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:tin:wpaper:20260023. 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: Tinbergen Office +31 (0)10-4088900 (email available below). General contact details of provider: https://edirc.repec.org/data/tinbenl.html .

    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.