相关论文: An explicit splitting SAV scheme for the kinetic L…

Adaptive or dynamic signal sampling in sensing systems can adapt subsequent sampling strategies based on acquired signals, thereby potentially improving image quality and speed. This paper proposes a Bayesian method for adaptive sampling…

The construction of effective and informative landscapes for stochastic dynamical systems has proven a long-standing and complex problem. In many situations, the dynamics may be described by a Langevin equation while constructing a…

A new approach in stochastic optimization via the use of stochastic gradient Langevin dynamics (SGLD) algorithms, which is a variant of stochastic gradient decent (SGD) methods, allows us to efficiently approximate global minimizers of…

Implicit-explicit (IMEX) time integration schemes are well suited for nonlinear structural dynamics because of their low computational cost and high accuracy. However, stability of IMEX schemes cannot be guaranteed for general nonlinear…

As sample sizes grow, scalability has become a central concern in the development of Markov chain Monte Carlo (MCMC) methods. One general approach to this problem, exemplified by the popular stochastic gradient Langevin dynamics (SGLD)…

We present a fast, unconditionally energy-stable numerical scheme for simulating vesicle deformation under osmotic pressure using a phase-field approach. The model couples an Allen-Cahn equation for the biomembrane interface with a…

We present a novel methodology based on filtered data and moving averages for estimating effective dynamics from observations of multiscale systems. We show in a semi-parametric framework of the Langevin type that our approach is…

By the probabilistic coupling approach which combines a new refined basic coupling with the synchronous coupling for L\'evy processes, we obtain explicit exponential contraction rates in terms of the standard $L^1$-Wasserstein distance for…

We present a novel optimization algorithm, element-wise relaxed scalar auxiliary variable (E-RSAV), that satisfies an unconditional energy dissipation law and exhibits improved alignment between the modified and the original energy. Our…

In this paper, we consider a second-order scalar auxiliary variable (SAV) Fourier spectral method to solve the nonlinear fractional generalized wave equation. Unconditional energy conservation or dissipation properties of the fully discrete…

Sampling from high-dimensional distributions has wide applications in data science and machine learning but poses significant computational challenges. We introduce Subspace Langevin Monte Carlo (SLMC), a novel and efficient sampling method…

We present a method for constructing numerical schemes with up to 3rd strong convergence order for solution of a class of stochastic differential equations, including equations of the Langevin type. The construction proceeds in two stages.…

We propose a new method called the Metropolis-adjusted Mirror Langevin algorithm for approximate sampling from distributions whose support is a compact and convex set. This algorithm adds an accept-reject filter to the Markov chain induced…

We consider the long-time behavior of an explicit tamed exponential Euler scheme applied to a class of parabolic semilinear stochastic partial differential equations driven by additive noise, under a one-sided Lipschitz continuity…

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…

We construct efficient implicit-explicit BDF$k$ scalar auxiliary variable (SAV) schemes for general dissipative systems. We show that these schemes are unconditionally stable, and lead to a uniform bound of the numerical solution in the…

We propose a scalable kinetic Langevin dynamics algorithm for sampling parameter spaces of big data and AI applications. Our scheme combines a symmetric forward/backward sweep over minibatches with a symmetric discretization of Langevin…

Stochastic Gradient (SG) Markov Chain Monte Carlo algorithms (MCMC) are popular algorithms for Bayesian sampling in the presence of large datasets. However, they come with little theoretical guarantees and assessing their empirical…

Priors with non-smooth log-densities, such as the l1-prior, are widely used in Bayesian inverse problems for their sparsity-inducing properties. Existing Langevin-based sampling methods typically rely on proximal mappings or smooth…

We propose discrete Langevin proposal (DLP), a simple and scalable gradient-based proposal for sampling complex high-dimensional discrete distributions. In contrast to Gibbs sampling-based methods, DLP is able to update all coordinates in…