IDEAS home Printed from https://ideas.repec.org/a/spr/stpapr/v65y2024i2d10.1007_s00362-023-01410-7.html
   My bibliography  Save this article

Kalman recursions Aggregated Online

Author

Listed:
  • Eric Adjakossa

    (MIA Paris-Saclay (UMR 518), Paris-Saclay University, AgroParisTech Campus)

  • Yannig Goude

    (EDF Lab)

  • Olivier Wintenberger

    (Sorbonne Université
    Universität Wien)

Abstract

In this article, we aim to improve the prediction from experts’ aggregation by using the underlying properties of the models that provide the experts involved in the aggregation procedure. We restrict ourselves to the case where experts perform their predictions by fitting state-space models to the data using Kalman recursions. Using exponential weights, we construct different Kalman recursions Aggregated Online (KAO) algorithms that compete with the best expert or the best convex combination of experts in a more or less adaptive way. When the experts are Kalman recursions, we improve the existing results on experts’ aggregation literature, taking advantage of the second-order properties of the Kalman recursions. We apply our approach to Kalman recursions and extend it to the general adversarial expert setting by state-space modeling the experts’ errors. We apply these new algorithms to a real-data set of electricity consumption and show how they can improve forecast performances compared to other exponentially weighted average procedures.

Suggested Citation

  • Eric Adjakossa & Yannig Goude & Olivier Wintenberger, 2024. "Kalman recursions Aggregated Online," Statistical Papers, Springer, vol. 65(2), pages 909-944, April.
    • Handle: RePEc:spr:stpapr:v:65:y:2024:i:2:d:10.1007_s00362-023-01410-7
    DOI: 10.1007/s00362-023-01410-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00362-023-01410-7
    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/s00362-023-01410-7?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:stpapr:v:65:y:2024:i:2:d:10.1007_s00362-023-01410-7. 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.