AEAndreas Eberle

Andreas Eberle

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Andreas Eberle has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Convergence rates of self-repellent random walks, their local time and Event Chain Monte Carlo

    by Andreas Eberle, Francis Lörler

    We study the rate of convergence to equilibrium of the self-repellent random walk and its local time process on the discrete circle $\mathbb{Z}_n$. While the self-repellent random walk alone is non-Markovian since the jump rates depend on its history via its local time, jointly considering the evolution of the local time profile and the position yields a piecewise deterministic, non-reversible Markov process. We show that this joint process can be interpreted as a second-order lift of a reversible diffusion process, the discrete stochastic heat equation with Gaussian invariant measure. In particular, we obtain a lower bound on the relaxation time of order $Ω(n^{3/2})$. Using a flow Poincaré inequality, we prove an upper bound for a slightly modified dynamics of order $O(n^2)$, matching recent conjectures in the physics literature. Furthermore, since the self-repellent random walk and its local time process coincide with the Event Chain Monte Carlo algorithm for the harmonic chain, a non-reversible MCMC method, we demonstrate that the relaxation time bound confirms the recent empirical observation that Event Chain Monte Carlo algorithms can outperform traditional MCMC methods such as Hamiltonian Monte Carlo.

    • 5 March 2025
    • Published by HAL in HAL
    Open Access

    Convergence of non-reversible Markov processes via lifting and flow Poincaré inequality

    by Andreas Eberle, Arnaud Guillin, Leo Hahn, Francis Lörler, Manon Michel

    We propose a general approach for quantitative convergence analysis of non-reversible Markov processes, based on the concept of second-order lifts and a variational approach to hypocoercivity. To this end, we introduce the flow Poincaré inequality, a space-time Poincaré inequality along trajectories of the semigroup, and a general divergence lemma based only on the Dirichlet form of an underlying reversible diffusion. We demonstrate the versatility of our approach by applying it to a pair of run-and-tumble particles with jamming, a model from non-equilibrium statistical mechanics, and several piecewise deterministic Markov processes used in sampling applications, in particular including general stochastic jump kernels.

  • Open Access

    Accelerated convergence in Hit-and-Run Monte Carlo and a coordinate-free randomized Kaczmarz algorithm

    by Nawaf Bou-Rabee, Andreas Eberle, Stefan Oberdörster

    Hit-and-Run is a coordinate-free Gibbs sampler, yet the quantitative advantages of its coordinate-free property remain largely unexplored beyond empirical studies. In this paper, we prove sharp estimates for the Wasserstein contraction of Hit-and-Run in Gaussian target measures via coupling methods and conclude mixing time bounds. Our results uncover accelerated convergence rates in certain settings. Furthermore, we extend these insights to a coordinate-free variant of the randomized Kaczmarz algorithm, an iterative method for linear systems, and demonstrate analogous convergence rates. These findings offer new insights into the advantages and limitations of coordinate-free methods for both sampling and optimization.

  • Open Access

    Space-time divergence lemmas and optimal non-reversible lifts of diffusions on Riemannian manifolds with boundary

    by Andreas Eberle, Francis Lörler

    Non-reversible lifts reduce the relaxation time of reversible diffusions at most by a square root. For reversible diffusions on domains in Euclidean space, or, more generally, on a Riemannian manifold with boundary, non-reversible lifts are in particular given by the Hamiltonian flow on the tangent bundle, interspersed with random velocity refreshments, or perturbed by Ornstein-Uhlenbeck noise, and reflected at the boundary. In order to prove that for certain choices of parameters, these lifts achieve the optimal square-root reduction up to a constant factor, precise upper bounds on relaxation times are required. A key tool for deriving such bounds by space-time Poincaré inequalities is a quantitative space-time divergence lemma. Extending previous work of Cao, Lu and Wang, we establish such a divergence lemma with explicit constants for general locally convex domains with smooth boundary in Riemannian manifolds satisfying a lower, not necessarily positive, curvature bound. As a consequence, we prove optimality of the lifts described above up to a constant factor, provided the deterministic transport part of the dynamics and the noise are adequately balanced. Our results show for example that an integrated Ornstein-Uhlenbeck process on a locally convex domain with diameter $d$ achieves a relaxation time of the order $d$, whereas, in general, the Poincaré constant of the domain is of the order $d^2$.

  • Open Access

    Ballistic Convergence in Hit-and-Run Monte Carlo and a Coordinate-free Randomized Kaczmarz Algorithm

    by Nawaf Bou-Rabee, Andreas Eberle, Stefan Oberdörster

    Hit-and-Run is a coordinate-free Gibbs sampler, yet the quantitative advantages of its coordinate-free property remain largely unexplored beyond empirical studies. In this paper, we prove sharp estimates for the Wasserstein contraction of Hit-and-Run in Gaussian target measures via coupling methods and conclude mixing time bounds. Our results uncover ballistic and superdiffusive convergence rates in certain settings. Furthermore, we extend these insights to a coordinate-free variant of the randomized Kaczmarz algorithm, an iterative method for linear systems, and demonstrate analogous convergence rates. These findings offer new insights into the advantages and limitations of coordinate-free methods for both sampling and optimization.

  • Open Access

    Non-reversible lifts of reversible diffusion processes and relaxation times

    by Andreas Eberle, Francis Lörler

    We propose a new concept of lifts of reversible diffusion processes and show that various well-known non-reversible Markov processes arising in applications are lifts in this sense of simple reversible diffusions. Furthermore, we introduce a concept of non-asymptotic relaxation times and show that these can at most be reduced by a square root through lifting, generalising a related result in discrete time. Finally, we demonstrate how the recently developed approach to quantitative hypocoercivity based on space–time Poincaré inequalities can be rephrased and simplified in the language of lifts and how it can be applied to find optimal lifts.


  • Open Access

    Non-reversible lifts of reversible diffusion processes and relaxation times

    by Andreas Eberle, Francis Lörler

    We propose a new concept of lifts of reversible diffusion processes and show that various well-known non-reversible Markov processes arising in applications are lifts in this sense of simple reversible diffusions. Furthermore, we introduce a concept of non-asymptotic relaxation times and show that these can at most be reduced by a square root through lifting, generalising a related result in discrete time. Finally, we demonstrate how the recently developed approach to quantitative hypocoercivity based on space-time Poincaré inequalities can be rephrased and simplified in the language of lifts and how it can be applied to find optimal lifts.

  • Open Access

    Discrete sticky couplings of functional autoregressive processes

    by Alain Durmus, Andreas Eberle, Aurélien Enfroy, Arnaud Guillin, Pierre Monmarché

    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

    Sticky nonlinear SDEs and convergence of McKean–Vlasov equations without confinement

    by Alain Durmus, Andreas Eberle, Arnaud Guillin, Katharina Schuh

    We develop a new approach to study the long time behaviour of solutions to nonlinear stochastic differential equations in the sense of McKean, as well as propagation of chaos for the corresponding mean-field particle system approximations. Our approach is based on a sticky coupling between two solutions to the equation. We show that the distance process between the two copies is dominated by a solution to a one-dimensional nonlinear stochastic differential equation with a sticky boundary at zero. This new class of equations is then analyzed carefully. In particular, we show that the dominating equation has a phase transition. In the regime where the Dirac measure at zero is the only invariant probability measure, we prove exponential convergence to equilibrium both for the one-dimensional equation, and for the original nonlinear SDE. Similarly, propagation of chaos is shown by a componentwise sticky coupling and comparison with a system of one dimensional nonlinear SDEs with sticky boundaries at zero. The approach applies to equations without confinement potential and to interaction terms that are not of gradient type.


  • Open Access

    Asymptotic bias of inexact Markov Chain Monte Carlo methods in high dimension

    by Alain Oliviero Durmus, Andreas Eberle

    Inexact Markov Chain Monte Carlo methods rely on Markov chains that do not exactly preserve the target distribution. Examples include the unadjusted Langevin algorithm (ULA) and unadjusted Hamiltonian Monte Carlo (uHMC). This paper establishes bounds on Wasserstein distances between the invariant probability measures of inexact MCMC methods and their target distributions with a focus on understanding the precise dependence of this asymptotic bias on both dimension and discretization step size. Assuming Wasserstein bounds on the convergence to equilibrium of either the exact or the approximate dynamics, we show that for both ULA and uHMC, the asymptotic bias depends on key quantities related to the target distribution or the stationary probability measure of the scheme. As a corollary, we conclude that for models with a limited amount of interactions such as mean-field models, finite range graphical models, and perturbations thereof, the asymptotic bias has a similar dependence on the step size and the dimension as for product measures.