One-step ahead sequential Super Learning from short times series of many slightly dependent data, and anticipating the cost of natural disasters

07/28/2021
by   Geoffrey Ecoto, et al.
0

Suppose that we observe a short time series where each time-t-specific data-structure consists of many slightly dependent data indexed by a and that we want to estimate a feature of the law of the experiment that depends neither on t nor on a. We develop and study an algorithm to learn sequentially which base algorithm in a user-supplied collection best carries out the estimation task in terms of excess risk and oracular inequalities. The analysis, which uses dependency graph to model the amount of conditional independence within each t-specific data-structure and a concentration inequality by Janson [2004], leverages 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. The so-called one-step ahead Super Learner is applied to the motivating example where the challenge is to anticipate the cost of natural disasters in France.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2022

Accelerating Frank-Wolfe Algorithm using Low-Dimensional and Adaptive Data Structures

In this paper, we study the problem of speeding up a type of optimizatio...
research
09/05/2019

McDiarmid-Type Inequalities for Graph-Dependent Variables and Stability Bounds

A crucial assumption in most statistical learning theory is that samples...
research
10/08/2019

Upper and Lower Bounds for Fully Retroactive Graph Problems

Classic dynamic data structure problems maintain a data structure subjec...
research
03/04/2019

Multiscale clustering of nonparametric regression curves

In a wide range of modern applications, we observe a large number of tim...
research
10/13/2020

Modeling and Probababilistic Forecasting of Natural Gas Prices

In this paper, we examine the problem of modeling and forecasting Europe...
research
10/18/2021

Data structure for node connectivity queries

Let κ(s,t) denote the maximum number of internally disjoint paths in an ...
research
12/13/2019

Conditional Super Learner

In this article we consider the Conditional Super Learner (CSL), an algo...

Please sign up or login with your details

Forgot password? Click here to reset