Related papers: The Riemannian Langevin equation and conic program…

The generalized Langevin equation (GLE) is a universal model for particle velocity in a viscoelastic medium. In this paper, we consider the GLE family with fractional memory kernels. We show that, in the critical regime where the memory…

Consensus algorithms are popular distributed algorithms for computing aggregate quantities, such as averages, in ad-hoc wireless networks. However, existing algorithms mostly address the case where the measurements lie in a Euclidean space.…

We study the design and implementation of numerical methods to solve the generalized Langevin equation (GLE) focusing on canonical sampling properties of numerical integrators. For this purpose, we cast the GLE in an extended phase space…

The general covariance of the diffusion equation is exploited in order to explore the curvature effects appearing on brownian motion over a d-dimensional curved manifold. We use the local frame defined by the so called Riemann normal…

The generalized Langevin equation is a model for the motion of coarse-grained particles where dissipative forces are represented by a memory term. The numerical realization of such a model requires the implementation of a stochastic…

Diffusion models are often introduced from multiple perspectives, such as VAEs, score matching, or flow matching, accompanied by dense and technically demanding mathematics that can be difficult for beginners to grasp. One classic question…

We propose a stochastic modified equations (SME) for modeling the asynchronous stochastic gradient descent (ASGD) algorithms. The resulting SME of Langevin type extracts more information about the ASGD dynamics and elucidates the…

The Generalized Riemann Problems (GRP) for nonlinear hyperbolic systems of balance laws in one space dimension are now well-known and can be formulated as follows: Given initial-data which are smooth on two sides of a discontinuity,…

We investigate regularizations of distributional sections of vector bundles by means of nets of smooth sections that preserve the main regularity properties of the original distributions (singular support, wavefront set, Sobolev…

We unify the variational hypocoercivity framework established by D. Albritton, S. Armstrong, J.-C. Mourrat, and M. Novack, with the notion of second-order lifts of reversible diffusion processes, recently introduced by A. Eberle and F.…

In this article we develop geometric versions of the classical Langevin equation on regular submanifolds in euclidean space in an easy, natural way and combine them with a bunch of applications. The equations are formulated as Stratonovich…

The complexity of molecular dynamics simulations necessitates dimension reduction and coarse-graining techniques to enable tractable computation. The generalized Langevin equation (GLE) describes coarse-grained dynamics in reduced…

We consider the scenario of supervised learning in Deep Learning (DL) networks, and exploit the arbitrariness of choice in the Riemannian metric relative to which the gradient descent flow can be defined (a general fact of differential…

We consider an explicitly solvable model (formulated in the Riemannian geometry terms) for a stationary wave process in a specific thin domain with the Dirichlet boundary conditions on the boundary of the domain. The transition from the…

In recent years, Riemannian stochastic gradient descent (R-SGD), Riemannian stochastic variance reduction (R-SVRG) and Riemannian stochastic recursive gradient (R-SRG) have attracted considerable attention on Riemannian optimization. Under…

The problem of mass diffusion in layered systems has relevance to applications in different scientific disciplines, e.g., chemistry, material science, soil science, and biomedical engineering. The mathematical challenge in these type of…

We consider the minimization of a function defined on a Riemannian manifold $\mathcal{M}$ accessible only through unbiased estimates of its gradients. We develop a geometric framework to transform a sequence of slowly converging iterates…

Stochastic Gradient Langevin Dynamics (SGLD) is a powerful algorithm for optimizing a non-convex objective, where a controlled and properly scaled Gaussian noise is added to the stochastic gradients to steer the iterates towards a global…

We propose an adaptively weighted stochastic gradient Langevin dynamics algorithm (SGLD), so-called contour stochastic gradient Langevin dynamics (CSGLD), for Bayesian learning in big data statistics. The proposed algorithm is essentially a…

Langevin dynamics has become a popular tool to simulate the Boltzmann equilibrium distribution. When the repartition of the Langevin equation involves the exact realization of the Ornstein-Uhlenbeck noise, in addition to the conventional…