Céline Labart
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Céline Labart has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Philippe Briand
Université Rennes 1
4 shared publications - Abir Ghannoum3 shared publications
- Adrien Richou
Institut de Mathématiques de Bordeaux UMR CNRS 5251 Université de Bordeaux France
2 shared publications - Ahmed Abdalazeez
Department of Marine Systems, Tallinn University of Technology, Akadeemia tee 15A, 12618 Tallinn, Estonia
2 shared publications - Alexander Steinicke
Department of Mathematics Technical University of Leoben Austria
2 shared publications - Arthur Martel2 shared publications
Latest Publications
- Open Access
Locally Lipschitz Path Dependent FBSDEs with Unbounded Terminal Conditions in Brownian and L{é}vy Settings
This paper is dedicated to the analysis of forward backward stochastic differential equations driven by a L{é}vy process. We assume that the generator and the terminal condition are path-dependent and satisfy a local Lipschitz condition. We study solvability and Malliavin differentiability of such BSDEs. The proof of the existence and uniqueness is done in three steps. First of all, we truncate and localize the terminal condition and the generator. Then we use an iteration argument to get bounds for the solutions of the truncated BSDE (independent from the level of truncation). Finally, we let the level of truncation tend to infinity. A stability result ends the proof. The Malliavin differentiability result is based on a recent characterisation for the Malliavin Sobolev space D 1,2 by S. Geiss and Zhou.
Open AccessLocally Lipschitz Path Dependent FBSDEs with Unbounded Terminal Conditions in Brownian and L{é}vy Settings
This paper is dedicated to the analysis of forward backward stochastic differential equations driven by a L{é}vy process. We assume that the generator and the terminal condition are path-dependent and satisfy a local Lipschitz condition. We study solvability and Malliavin differentiability of such BSDEs. The proof of the existence and uniqueness is done in three steps. First of all, we truncate and localize the terminal condition and the generator. Then we use an iteration argument to get bounds for the solutions of the truncated BSDE (independent from the level of truncation). Finally, we let the level of truncation tend to infinity. A stability result ends the proof. The Malliavin differentiability result is based on a recent characterisation for the Malliavin Sobolev space D 1,2 by S. Geiss and Zhou.
- Open Access
Locally Lipschitz Path Dependent FBSDEs with Unbounded Terminal Conditions in Brownian and Lévy Settings
This paper is dedicated to the analysis of forward backward stochastic differential equations driven by a Lévy process. We assume that the generator and the terminal condition are path-dependent and satisfy a local Lipschitz condition. We study solvability and Malliavin differentiability of such BSDEs.The proof of the existence and uniqueness is done in three steps. First of all, we truncate and localize the terminal condition and the generator. Then we use an iteration argument to get bounds for the solutions of the truncated BSDE (independent from the level of truncation). Finally, we let the level of truncation tend to infinity. A stability result ends the proof. The Malliavin differentiability result is based on a recent characterisation for the Malliavin Sobolev space D 1,2 by S. Geiss and Zhou.
Open AccessLocally Lipschitz Path Dependent FBSDEs with Unbounded Terminal Conditions in Brownian and Lévy Settings
This paper is dedicated to the analysis of forward backward stochastic differential equations driven by a Lévy process. We assume that the generator and the terminal condition are path-dependent and satisfy a local Lipschitz condition. We study solvability and Malliavin differentiability of such BSDEs.The proof of the existence and uniqueness is done in three steps. First of all, we truncate and localize the terminal condition and the generator. Then we use an iteration argument to get bounds for the solutions of the truncated BSDE (independent from the level of truncation). Finally, we let the level of truncation tend to infinity. A stability result ends the proof. The Malliavin differentiability result is based on a recent characterisation for the Malliavin Sobolev space D 1,2 by S. Geiss and Zhou.
- Open Access
AUTOMATIC CLUSTERING OF INDUSTRIAL DATA WITH THE CONNECTED COMPONENTS
This paper proposes the use of techniques from the field of graph theory to automatically determine and cluster the same types of observations without prior knowledge on their number. The idea is to create a graph where observations are vertices and an edge between two observations exists if and only if one observation is in the nearest neighbourhood of another one. Connected components of the graphs can be then considered as groups of observations of the same type. The approach is particularly useful for multiclass anomaly detection in the context of Industry 4.0.
Open AccessAUTOMATIC CLUSTERING OF INDUSTRIAL DATA WITH THE CONNECTED COMPONENTS
This paper proposes the use of techniques from the field of graph theory to automatically determine and cluster the same types of observations without prior knowledge on their number. The idea is to create a graph where observations are vertices and an edge between two observations exists if and only if one observation is in the nearest neighbourhood of another one. Connected components of the graphs can be then considered as groups of observations of the same type. The approach is particularly useful for multiclass anomaly detection in the context of Industry 4.0.
- Open Access
AUTOMATIC CLUSTERING OF INDUSTRIAL DATA WITH THE CONNECTED COMPONENTS
This paper proposes the use of techniques from the field of graph theory to automatically determine and cluster the same types of observations without prior knowledge on their number. The idea is to create a graph where observations are vertices and an edge between two observations exists if and only if one observation is in the nearest neighbourhood of another one. Connected components of the graphs can be then considered as groups of observations of the same type. The approach is particularly useful for multiclass anomaly detection in the context of Industry 4.0.
Open AccessAUTOMATIC CLUSTERING OF INDUSTRIAL DATA WITH THE CONNECTED COMPONENTS
This paper proposes the use of techniques from the field of graph theory to automatically determine and cluster the same types of observations without prior knowledge on their number. The idea is to create a graph where observations are vertices and an edge between two observations exists if and only if one observation is in the nearest neighbourhood of another one. Connected components of the graphs can be then considered as groups of observations of the same type. The approach is particularly useful for multiclass anomaly detection in the context of Industry 4.0.
- Open Access
Distance Rank Score: Unsupervised filter method for feature selection on imbalanced dataset
This paper presents a new filter method for unsupervised feature selection. This method is particularly effective on imbalanced multi-class dataset, as in case of clusters of different anomaly types. Existing methods usually involve the variance of the features, which is not suitable when the different types of observations are not represented equally. Our method, based on Spearman's Rank Correlation between distances on the observations and on feature values, avoids this drawback. The performance of the method is measured on several clustering problems and is compared with existing filter methods suitable for unsupervised data.
Open AccessDistance Rank Score: Unsupervised filter method for feature selection on imbalanced dataset
This paper presents a new filter method for unsupervised feature selection. This method is particularly effective on imbalanced multi-class dataset, as in case of clusters of different anomaly types. Existing methods usually involve the variance of the features, which is not suitable when the different types of observations are not represented equally. Our method, based on Spearman's Rank Correlation between distances on the observations and on feature values, avoids this drawback. The performance of the method is measured on several clustering problems and is compared with existing filter methods suitable for unsupervised data.
- Open Access
Explainable multi-class anomaly detection on functional data
In this paper we describe an approach for anomaly detection and its explainability in multivariate functional data. The anomaly detection procedure consists of transforming the series into a vector of features and using an Isolation forest algorithm. The explainable procedure is based on the computation of the SHAP coefficients and on the use of a supervised decision tree. We apply it on simulated data to measure the performance of our method and on real data coming from industry.
Open AccessExplainable multi-class anomaly detection on functional data
In this paper we describe an approach for anomaly detection and its explainability in multivariate functional data. The anomaly detection procedure consists of transforming the series into a vector of features and using an Isolation forest algorithm. The explainable procedure is based on the computation of the SHAP coefficients and on the use of a supervised decision tree. We apply it on simulated data to measure the performance of our method and on real data coming from industry.
- 1 June 2020
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 52 (2) , 523-562
Mean reflected stochastic differential equations with jumps
In this paper, a reflected stochastic differential equation (SDE) with jumps is studied for the case where the constraint acts on the law of the solution rather than on its paths. These reflected SDEs have been approximated by Briand et al. (2016) using a numerical scheme based on particles systems, when no jumps occur. The main contribution of this paper is to prove the existence and the uniqueness of the solutions to this kind of reflected SDE with jumps and to generalize the results obtained by Briand et al. (2016) to this context.
- 1 June 2020
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 52 (2) , 523-562
Mean reflected stochastic differential equations with jumps
In this paper, a reflected stochastic differential equation (SDE) with jumps is studied for the case where the constraint acts on the law of the solution rather than on its paths. These reflected SDEs have been approximated by Briand et al. (2016) using a numerical scheme based on particles systems, when no jumps occur. The main contribution of this paper is to prove the existence and the uniqueness of the solutions to this kind of reflected SDE with jumps and to generalize the results obtained by Briand et al. (2016) to this context.
- Open Access
Extreme Inundation Statistics on a Composite Beach
The runup of initial Gaussian narrow-banded and wide-banded wave fields and its statistical characteristics are investigated using direct numerical simulations, based on the nonlinear shallow water equations. The bathymetry consists of the section of a constant depth, which is matched with the beach of constant slope. To address different levels of nonlinearity, time series with five different significant wave heights are considered. The selected wave parameters allow for also seeing the effects of wave breaking on wave statistics. The total physical time of each simulated time-series is 1000 h (~360,000 wave periods). The statistics of calculated wave runup heights are discussed with respect to the wave nonlinearity, wave breaking and the bandwidth of the incoming wave field. The conditional Weibull distribution is suggested as a model for the description of extreme runup heights and the assessment of extreme inundations.
Open AccessExtreme Inundation Statistics on a Composite Beach
The runup of initial Gaussian narrow-banded and wide-banded wave fields and its statistical characteristics are investigated using direct numerical simulations, based on the nonlinear shallow water equations. The bathymetry consists of the section of a constant depth, which is matched with the beach of constant slope. To address different levels of nonlinearity, time series with five different significant wave heights are considered. The selected wave parameters allow for also seeing the effects of wave breaking on wave statistics. The total physical time of each simulated time-series is 1000 h (~360,000 wave periods). The statistics of calculated wave runup heights are discussed with respect to the wave nonlinearity, wave breaking and the bandwidth of the incoming wave field. The conditional Weibull distribution is suggested as a model for the description of extreme runup heights and the assessment of extreme inundations.
- Open Access
Extreme Inundation Statistics on a Composite Beach
The runup of initial Gaussian narrow-banded and wide-banded wave fields and its statistical characteristics are investigated using direct numerical simulations, based on the nonlinear shallow water equations. The bathymetry consists of the section of a constant depth, which is matched with the beach of constant slope. To address different levels of nonlinearity, the time series with five different significant wave heights are considered. The selected wave parameters allow also seeing the effects of wave breaking on wave statistics. The total physical time of each simulated time-series is 1000 hours (~360000 wave periods). The statistics of calculated wave runup heights are discussed with respect to the wave nonlinearity, wave breaking and the bandwidth of the incoming wave field. The conditional Weibull distribution is suggested as a model for the description of extreme runup heights and assessment of extreme inundations.
Open AccessExtreme Inundation Statistics on a Composite Beach
The runup of initial Gaussian narrow-banded and wide-banded wave fields and its statistical characteristics are investigated using direct numerical simulations, based on the nonlinear shallow water equations. The bathymetry consists of the section of a constant depth, which is matched with the beach of constant slope. To address different levels of nonlinearity, the time series with five different significant wave heights are considered. The selected wave parameters allow also seeing the effects of wave breaking on wave statistics. The total physical time of each simulated time-series is 1000 hours (~360000 wave periods). The statistics of calculated wave runup heights are discussed with respect to the wave nonlinearity, wave breaking and the bandwidth of the incoming wave field. The conditional Weibull distribution is suggested as a model for the description of extreme runup heights and assessment of extreme inundations.
- Open Access
Simulation of McKean-Vlasov BSDEs by Wiener chaos expansion
We present an algorithm to solve McKean-Vlasov BSDEs based on Wiener chaos expansion and Picard's iterations and study its convergence. This paper extends the results obtained by Briand and Labart in [BL14] when standard BSDEs were considered. Here we are faced with the problem of the approximation of the law of (Y, Z) in the driver, that we solve by using a particle system. In order to avoid solving a system of BSDEs, which would not be feasible in practice, we use the same particles to approximate the law of (Y, Z) and to compute Monte Carlo approximations. This leads to an algorithm which doesn't cost more than the standard one.
Open AccessSimulation of McKean-Vlasov BSDEs by Wiener chaos expansion
We present an algorithm to solve McKean-Vlasov BSDEs based on Wiener chaos expansion and Picard's iterations and study its convergence. This paper extends the results obtained by Briand and Labart in [BL14] when standard BSDEs were considered. Here we are faced with the problem of the approximation of the law of (Y, Z) in the driver, that we solve by using a particle system. In order to avoid solving a system of BSDEs, which would not be feasible in practice, we use the same particles to approximate the law of (Y, Z) and to compute Monte Carlo approximations. This leads to an algorithm which doesn't cost more than the standard one.