Related papers: Splitting AVF method for generalized Langevin equa…
In this paper, we present an energy-preserving exponentially integrable numerical method for stochastic wave equation with cubic nonlinearity and additive noise. We first apply the spectral Galerkin method to discretizing the original…
It is shown that the solution of generalized Langevin equation can be obtained on the basis of simple comparison of the time scale for the velocity autocorrelation function of a particle (atom, molecule) and of the time scale for the…
Affine variational inequalities (AVI) are an important problem class that generalize systems of linear equations, linear complementarity problems and optimality conditions for quadratic programs. This paper describes PATHAVI, a…
Given a particle system obeying overdamped Langevin dynamics, we demonstrate that it is always possible to construct a thermodynamically consistent macroscopic model which obeys a gradient flow with respect to its non-equilibrium free…
Vehicular edge intelligence (VEI) is a promising paradigm for enabling future intelligent transportation systems by accommodating artificial intelligence (AI) at the vehicular edge computing (VEC) system. Federated learning (FL) stands as…
A large class of quantum and statistical field theoretical models, encompassing relevant condensed matter and non-abelian gauge systems, are defined in terms of complex actions. As the ordinary Monte-Carlo methods are useless in dealing…
We present a new tunably-accurate Laguerre Petrov-Galerkin spectral method for solving linear multi-term fractional initial value problems with derivative orders at most one and constant coefficients on the half line. Our method results in…
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 present a novel high-order accurate nodal discontinuous Galerkin (DG) method for solving nonlinear hyperbolic systems of partial differential equations (PDEs) on fully unstructured three-dimensional polyhedral meshes. A mesh generator is…
We introduce a new perspective on spectral dimensionality reduction which views these methods as Gaussian Markov random fields (GRFs). Our unifying perspective is based on the maximum entropy principle which is in turn inspired by maximum…
In this paper, we construct a novel Eulerian-Lagrangian finite volume (ELFV) method for nonlinear scalar hyperbolic equations in one space dimension. It is well known that the exact solutions to such problems may contain shocks though the…
We consider the finite element (FE) approximation of the shallow water equations (SWE) by considering discretizations in which both space and time are established using an unconditionally stable FE method. Particularly, we consider the…
Generating an initial condition for a Langevin equation with memory is a non trivial issue. We introduce a generalisation of the Laplace transform as a useful tool for solving this problem, in which a limit procedure may send the extension…
This work deals with uncertainty quantification for a generic input distribution to some resource-intensive simulation, e.g., requiring the solution of a partial differential equation. While efficient numerical methods exist to compute…
Learning a generative model from partial data (data with missingness) is a challenging area of machine learning research. We study a specific implementation of the Auto-Encoding Variational Bayes (AEVB) algorithm, named in this paper as a…
Normalizing flows (NF) use a continuous generator to map a simple latent (e.g. Gaussian) distribution, towards an empirical target distribution associated with a training data set. Once trained by minimizing a variational objective, the…
The simulation of high-dimensional problems with manageable computational resource represents a long-standing challenge. In a series of our recent work [25, 17, 18, 24], a class of sparse grid DG methods has been formulated for solving…
In this paper we investigate how gradient-based algorithms such as gradient descent, (multi-pass) stochastic gradient descent, its persistent variant, and the Langevin algorithm navigate non-convex loss-landscapes and which of them is able…
Nesterov's accelerated gradient methods (AGM) have been successfully applied in many machine learning areas. However, their empirical performance on training max-margin models has been inferior to existing specialized solvers. In this…
A general framework for the numerical approximation of evolution problems is presented that allows to preserve exactly an underlying Hamiltonian- or gradient structure. The approach relies on rewriting the evolution problem in a particular…