

Exploring the High-dimensional Random Landscapes of Data Science (3/3)
De Gérard Ben Arous


Exploring the High-dimensional Random Landscapes of Data Science (1/3)
De Gérard Ben Arous
Apparaît dans les collections : Exposés de recherche, CEMRACS - Summer school: Numerical methods for stochastic models: control, uncertainty quantification, mean-field / CEMRACS - École d'été : Méthodes numériques pour équations stochastiques : contrôle, incertitude, champ moyen
Consider a problem of Markovian trajectories of particles for which you are trying to estimate the probability of a event. Under the assumption that you can represent this event as the last event of a nested sequence of events, it is possible to design a splitting algorithm to estimate the probability of the last event in an efficient way. Moreover you can obtain a sequence of trajectories which realize this particular event, giving access to statistical representation of quantities conditionally to realize the event. In this talk I will present the "Adaptive Multilevel Splitting" algorithm and its application to various toy models. I will explain why it creates an unbiased estimator of a probability, and I will give results obtained from numerical simulations.