Aurélien Enfroy
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
Aurélien Enfroy has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Alain Durmus
Ecole Polytechnique Route de Saclay 91120 Palaiseau France
2 shared publications - Andreas Eberle
Institute for Applied Mathematics University of Bonn
2 shared publications - Arnaud Guillin
Laboratoire de Mathématiques Blaise Pascal UMR 6620, CNRS, Université Clermont-Auvergne, Aubière, France
2 shared publications - Pierre Monmarché
Sorbonne Universite
2 shared publications - Alain Durmus
CMLA -École normale supérieure Paris-Saclay CNRS Université Paris-Saclay 94235 Cachan France
1 shared publication - Alain Durmus
Université Paris-Saclay ENS Paris-Saclay CNRS Centre Borelli F-91190 Gif-sur-Yvette France
1 shared publication
Latest Publications
- Open Access
Discrete sticky couplings of functional autoregressive processes
In this paper, we provide bounds in Wasserstein and total variation distances between the distributions of the successive iterates of two functional autoregressive processes with isotropic Gaussian noise of the form $Y_{k+1} = \mathrm{T}_\gamma(Y_k) + \sqrt{\gamma\sigma^2} Z_{k+1}$ and $\tilde{Y}_{k+1} = \tilde{\mathrm{T}}_\gamma(\tilde{Y}_k) + \sqrt{\gamma\sigma^2} \tilde{Z}_{k+1}$. More precisely, we give non-asymptotic bounds on $\rho(\mathcal{L}(Y_{k}),\mathcal{L}(\tilde{Y}_k))$, where $\rho$ is an appropriate weighted Wasserstein distance or a $V$-distance, uniformly in the parameter $\gamma$, and on $\rho(\pi_{\gamma},\tilde{\pi}_{\gamma})$, where $\pi_{\gamma}$ and $\tilde{\pi}_{\gamma}$ are the respective stationary measures of the two processes. The class of considered processes encompasses the Euler-Maruyama discretization of Langevin diffusions and its variants. The bounds we derive are of order $\gamma$ as $\gamma \to 0$. To obtain our results, we rely on the construction of a discrete sticky Markov chain $(W_k^{(\gamma)})_{k \in \mathbb{N}}$ which bounds the distance between an appropriate coupling of the two processes. We then establish stability and quantitative convergence results for this process uniformly on $\gamma$. In addition, we show that it converges in distribution to the continuous sticky process studied in previous work. Finally, we apply our result to Bayesian inference of ODE parameters and numerically illustrate them on two particular problems.Open AccessDiscrete sticky couplings of functional autoregressive processes
In this paper, we provide bounds in Wasserstein and total variation distances between the distributions of the successive iterates of two functional autoregressive processes with isotropic Gaussian noise of the form $Y_{k+1} = \mathrm{T}_\gamma(Y_k) + \sqrt{\gamma\sigma^2} Z_{k+1}$ and $\tilde{Y}_{k+1} = \tilde{\mathrm{T}}_\gamma(\tilde{Y}_k) + \sqrt{\gamma\sigma^2} \tilde{Z}_{k+1}$. More precisely, we give non-asymptotic bounds on $\rho(\mathcal{L}(Y_{k}),\mathcal{L}(\tilde{Y}_k))$, where $\rho$ is an appropriate weighted Wasserstein distance or a $V$-distance, uniformly in the parameter $\gamma$, and on $\rho(\pi_{\gamma},\tilde{\pi}_{\gamma})$, where $\pi_{\gamma}$ and $\tilde{\pi}_{\gamma}$ are the respective stationary measures of the two processes. The class of considered processes encompasses the Euler-Maruyama discretization of Langevin diffusions and its variants. The bounds we derive are of order $\gamma$ as $\gamma \to 0$. To obtain our results, we rely on the construction of a discrete sticky Markov chain $(W_k^{(\gamma)})_{k \in \mathbb{N}}$ which bounds the distance between an appropriate coupling of the two processes. We then establish stability and quantitative convergence results for this process uniformly on $\gamma$. In addition, we show that it converges in distribution to the continuous sticky process studied in previous work. Finally, we apply our result to Bayesian inference of ODE parameters and numerically illustrate them on two particular problems. - Open Access
Boost your favorite Markov Chain Monte Carlo sampler using Kac's theorem: the Kick-Kac teleportation algorithm
The present paper focuses on the problem of sampling from a given target distribution $\pi$ defined on some general state space. To this end, we introduce a novel class of non-reversible Markov chains, each chain being defined on an extended state space and having an invariant probability measure admitting $\pi$ as a marginal distribution. The proposed methodology is inspired by a new formulation of Kac's theorem and allows global and local dynamics to be smoothly combined. Under mild conditions, the corresponding Markov transition kernel can be shown to be irreducible and Harris recurrent. In addition, we establish that geometric ergodicity holds under appropriate conditions on the global and local dynamics. Finally, we illustrate numerically the use of the proposed method and its potential benefits in comparison to existing Markov chain Monte Carlo (MCMC) algorithms.Open AccessBoost your favorite Markov Chain Monte Carlo sampler using Kac's theorem: the Kick-Kac teleportation algorithm
The present paper focuses on the problem of sampling from a given target distribution $\pi$ defined on some general state space. To this end, we introduce a novel class of non-reversible Markov chains, each chain being defined on an extended state space and having an invariant probability measure admitting $\pi$ as a marginal distribution. The proposed methodology is inspired by a new formulation of Kac's theorem and allows global and local dynamics to be smoothly combined. Under mild conditions, the corresponding Markov transition kernel can be shown to be irreducible and Harris recurrent. In addition, we establish that geometric ergodicity holds under appropriate conditions on the global and local dynamics. Finally, we illustrate numerically the use of the proposed method and its potential benefits in comparison to existing Markov chain Monte Carlo (MCMC) algorithms. - Open Access
Uniform minorization condition and convergence bounds for discretizations of kinetic Langevin dynamics
We study the convergence in total variation and $V$-norm of discretization schemes of the underdamped Langevin dynamics. Such algorithms are very popular and commonly used in molecular dynamics and computational statistics to approximatively sample from a target distribution of interest. We show first that, for a very large class of schemes, a minorization condition uniform in the stepsize holds. This class encompasses popular methods such as the Euler-Maruyama scheme and the schemes based on splitting strategies. Second, we provide mild conditions ensuring that the class of schemes that we consider satisfies a geometric Foster--Lyapunov drift condition, again uniform in the stepsize. This allows us to derive geometric convergence bounds, with a convergence rate scaling linearly with the stepsize. This kind of result is of prime interest to obtain estimates on norms of solutions to Poisson equations associated with a given numerical method.
Open AccessUniform minorization condition and convergence bounds for discretizations of kinetic Langevin dynamics
We study the convergence in total variation and $V$-norm of discretization schemes of the underdamped Langevin dynamics. Such algorithms are very popular and commonly used in molecular dynamics and computational statistics to approximatively sample from a target distribution of interest. We show first that, for a very large class of schemes, a minorization condition uniform in the stepsize holds. This class encompasses popular methods such as the Euler-Maruyama scheme and the schemes based on splitting strategies. Second, we provide mild conditions ensuring that the class of schemes that we consider satisfies a geometric Foster--Lyapunov drift condition, again uniform in the stepsize. This allows us to derive geometric convergence bounds, with a convergence rate scaling linearly with the stepsize. This kind of result is of prime interest to obtain estimates on norms of solutions to Poisson equations associated with a given numerical method.
- Open Access
DISCRETE STICKY COUPLING OF FUNCTIONAL AUTOREGRESSIVE PROCESSES
In this paper, we provide bounds in various metrics betweenthe successive iterates of two functional autoregressive processes withisotropic Gaussian noise of the form $Y_{k+1}=T_\gamma(Y_k)+\sqrt{\gamma\sigma^2}Z_{k+1}$and $\tilde Y_{k+1}=\tilde T_\gamma(\tilde Y_k)+\sqrt{\gamma\sigma^2}Z_{k+1}$ in the limit where the param-eter γ → 0. More precisely, we give non-asymptotic bounds on$\rho(L(Y_k),L(\tilde Y_k))$, where ρ is an appropriate weighted Wasserstein dis-tance or a V -distance, uniformly in the parameter γ, and on $\rho(\pi_\gamma , \tilde \pi_\gamma),where $\pi_\gamma$ and $\tilde\pi_\gamma$ are the respective stationary measures of the twoprocesses. Of particular interest, this class of processes encompassesthe Euler-Maruyama discretization of Langevin diffusions and itsvariants. To obtain our results, we rely on the construction of a dis-crete Markov chain $(W^{(\gamma)})_{k\in N}$ for which we are able to bound the kmoments and show quantitative convergence rates uniform on γ. In addition, we show that this process converges in distribution to the continuous sticky process studied in [20, 18]. Finally, we illustrate our result on two numerical applications.Open AccessDISCRETE STICKY COUPLING OF FUNCTIONAL AUTOREGRESSIVE PROCESSES
In this paper, we provide bounds in various metrics betweenthe successive iterates of two functional autoregressive processes withisotropic Gaussian noise of the form $Y_{k+1}=T_\gamma(Y_k)+\sqrt{\gamma\sigma^2}Z_{k+1}$and $\tilde Y_{k+1}=\tilde T_\gamma(\tilde Y_k)+\sqrt{\gamma\sigma^2}Z_{k+1}$ in the limit where the param-eter γ → 0. More precisely, we give non-asymptotic bounds on$\rho(L(Y_k),L(\tilde Y_k))$, where ρ is an appropriate weighted Wasserstein dis-tance or a V -distance, uniformly in the parameter γ, and on $\rho(\pi_\gamma , \tilde \pi_\gamma),where $\pi_\gamma$ and $\tilde\pi_\gamma$ are the respective stationary measures of the twoprocesses. Of particular interest, this class of processes encompassesthe Euler-Maruyama discretization of Langevin diffusions and itsvariants. To obtain our results, we rely on the construction of a dis-crete Markov chain $(W^{(\gamma)})_{k\in N}$ for which we are able to bound the kmoments and show quantitative convergence rates uniform on γ. In addition, we show that this process converges in distribution to the continuous sticky process studied in [20, 18]. Finally, we illustrate our result on two numerical applications.