Related papers: A Stochastic Genetic Interacting Particle Method f…
We introduce a general framework for approximating parabolic Stochastic Partial Differential Equations (SPDEs) based on fluctuation-dissipation balance. Using this approach we formulate Stochastic Discontinuous Galerkin Methods (SDGM). We…
We study numerical methods for dissipative particle dynamics (DPD), which is a system of stochastic differential equations and a popular stochastic momentum-conserving thermostat for simulating complex hydrodynamic behavior at mesoscales.…
In order to numerically solve high-dimensional nonlinear PDEs and alleviate the curse of dimensionality, a stochastic particle method (SPM) has been proposed to capture the relevant feature of the solution through the adaptive evolution of…
The stochastic gradient (SG) method can minimize an objective function composed of a large number of differentiable functions, or solve a stochastic optimization problem, to a moderate accuracy. The block coordinate descent/update (BCD)…
This paper presents a methodology for using varying sample sizes in sequential quadratic programming (SQP) methods for solving equality constrained stochastic optimization problems. The first part of the paper deals with the delicate issue…
`Gating' is a widely observed phenomenon in biochemistry that describes the transition between the activated (or open) and deactivated (or closed) states of an ion-channel, which makes transport through that channel highly selective. In…
We investigate Turing pattern formation in a stochastic and spatially discretized version of a reaction diffusion advection (RDA) equation, which was previously introduced to model synaptogenesis in \textit{C. elegans}. The model describes…
In this paper we analyze the behaviour of the stochastic gradient descent (SGD), a widely used method in supervised learning for optimizing neural network weights via a minimization of non-convex loss functions. Since the pioneering work of…
Benders decomposition is one of the most applied methods to solve two-stage stochastic problems (TSSP) with a large number of scenarios. The main idea behind the Benders decomposition is to solve a large problem by replacing the values of…
We study a stochastic system of $N$ interacting particles which models bimolecular chemical reaction-diffusion. In this model, each particle $i$ carries two attributes: the spatial location $X_t^i\in \mathbb{T}^d$, and the type $\Xi_t^i\in…
While the analytical solution for the marginal distribution of a stochastic chemical reaction network has been extensively studied, its joint distribution, i.e. the solution of a high-dimensional chemical master equation, has received much…
Progressively applying Gaussian noise transforms complex data distributions to approximately Gaussian. Reversing this dynamic defines a generative model. When the forward noising process is given by a Stochastic Differential Equation (SDE),…
The present contribution proposes a universal framework to formulate generalized section-section interaction potentials (SSIP) within the geometrically exact beam theory. By exploiting the fundamental kinematic assumption of undeformable…
Saddle point search schemes are widely used to identify the transition state of different processes, like chemical reactions, surface and bulk diffusion, surface adsorption, and many more. In solid-state materials with relatively large…
Distributed stochastic gradient descent (SGD) with gradient compression has become a popular communication-efficient solution for accelerating distributed learning. One commonly used method for gradient compression is Top-K sparsification,…
This paper aims to establish a first general error estimate for numerical approximations of the system of reaction-diffusion equations (SRDEs), using reasonable regularity assumptions on the exact solutions. We employ the gradient…
In distributed training of deep neural networks, people usually run Stochastic Gradient Descent (SGD) or its variants on each machine and communicate with other machines periodically. However, SGD might converge slowly in training some deep…
We consider a general interacting particle system with interactions on a random graph, and study the large population limit of this system. When the sequence of underlying graphs converges to a graphon, we show convergence of the…
For conventional smoothed particle hydrodynamics (SPH), obtaining the static solution of a problem is time-consuming. To address this drawback, we propose an efficient dynamic relaxation method by adding large artificial-viscosity-based…
This study presents the Fourier-Gegenbauer Integral-Galerkin (FGIG) method, a novel and efficient numerical framework for solving the one-dimensional advection-diffusion equation with periodic boundary conditions. The FGIG method uniquely…