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

Forecasting the cost of drought events in France by Super Learning from a short time series of many slightly dependent data

Author

Listed:
  • Geoffrey Ecoto

    (Caisse Centrale de Réassurance
    Université Paris Cité)

  • Aurélien F. Bibaut

    (UC Berkeley)

  • Antoine Chambaz

    (Université Paris Cité)

Abstract

Drought events are the second most expensive type of natural disaster within the French legal framework known as the natural disasters compensation scheme. In recent years, drought events have been remarkable in their geographical location and scale and in their intensity. We develop and apply a new methodology to forecast the cost of a drought event in France. The methodology hinges on Super Learning (van der Laan et al. in Stat Appl Genet Mol Biol 6:23, 2007; Benkeser et al. Stat Med 37:249-260, 2018), a general aggregation strategy to learn a feature of the law of the data identified through an ad hoc risk function by relying on a library of algorithms. The algorithms either compete (discrete Super Learning) or collaborate (continuous Super Learning), with a cross-validation scheme determining the best performing algorithm or combination of algorithms. The theoretical analysis reveals that our Super Learner can learn from a short time series where each time-t-specific data-structure consists of many slightly dependent data indexed by a. We use a dependency graph to model the amount of conditional independence within each t-specific data-structure and a concentration inequality by Janson (Random Struct Algorithms 24:234-248, 2004) and leverage a large ratio of the number of distinct a-s to the degree of the dependency graph in the face of a small number of t-specific data-structures.

Suggested Citation

  • Geoffrey Ecoto & Aurélien F. Bibaut & Antoine Chambaz, 2025. "Forecasting the cost of drought events in France by Super Learning from a short time series of many slightly dependent data," Computational Statistics, Springer, vol. 40(5), pages 2277-2321, June.
  • Handle: RePEc:spr:compst:v:40:y:2025:i:5:d:10.1007_s00180-024-01549-3
    DOI: 10.1007/s00180-024-01549-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-024-01549-3
    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-01549-3?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:5:d:10.1007_s00180-024-01549-3. 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.