相关论文: An augmented moment method for stochastic ensemble…

Dynamics of FitzHugh-Nagumo (FN) neuron ensembles with time-delayed couplings subject to white noises, has been studied by using both direct simulations and a semi-analytical augmented moment method (AMM) which has been proposed in a recent…

We have studied the synchronization induced by periodic inputs applied to the finite $N$-unit coupled bistable Langevin model which is subjected to cross-correlated additive and multiplicative noises. Effects on the synchronization of the…

Finite $N$-unit Langevin models with additive and multiplicative noises have been studied with the use of the augmented moment method (AMM) previously proposed by the author [H. Hasegawa, Phys. Rev E {\bf 67}, 041903 (2003)]. Original…

We have studied the finite $N$-unit Langevin model subjected to multiplicative noises, by using the augmented moment method (AMM), as a continuation of our previous paper [H. Hasegawa, J. Phys. Soc. Jpn. {\bf 75} (2006) 033001]. Effects of…

We have studied the dynamical properties of finite $N$-unit FitzHugh-Nagumo (FN) ensembles subjected to additive and/or multiplicative noises, reformulating the augmented moment method (AMM) with the Fokker-Planck equation (FPE) method [H.…

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…

Optimization algorithms with momentum, e.g., (ADAM), have been widely used for building deep learning models due to the faster convergence rates compared with stochastic gradient descent (SGD). Momentum helps accelerate SGD in the relevant…

Stochastic version of alternating direction method of multiplier (ADMM) and its variants (linearized ADMM, gradient-based ADMM) plays a key role for modern large scale machine learning problems. One example is the regularized empirical risk…

Recently, there has been great interest in connections between continuous-time dynamical systems and optimization methods, notably in the context of accelerated methods for smooth and unconstrained problems. In this paper we extend this…

We develop two new variants of alternating direction methods of multipliers (ADMM) and two parallel primal-dual decomposition algorithms to solve a wide range class of constrained convex optimization problems. Our approach relies on a novel…

Computation methods for solving entropy-regularized reward optimization -- a class of problems widely used for fine-tuning generative models -- have advanced rapidly. Among those, Adjoint Matching (AM, Domingo-Enrich et al., 2025) has…

This paper investigates the distributed stochastic nonconvex and nonsmooth composite optimization problem. Existing stochastic typically rely on uniform step size strictly bounded by global network parameters, such as the maximum node…

Ensemble methods have become ubiquitous for the solution of Bayesian inference problems. State-of-the-art Langevin samplers such as the Ensemble Kalman Sampler (EKS), Affine Invariant Langevin Dynamics (ALDI) or its extension using weighted…

In this paper, a stochastic alternating direction method of multipliers (ADMM) is proposed for a class of nonsmooth composite and stochastic convex optimization problems in Hilbert space, motivated by optimization problems constrained by…

We propose a sampling method based on an ensemble approximation of second order Langevin dynamics. The log target density is appended with a quadratic term in an auxiliary momentum variable and damped-driven Hamiltonian dynamics introduced;…

This paper introduces Magnus-based methods for solving stochastic delay-differential equations (SDDEs). We construct Magnus--Euler--Maruyama (MEM) and Magnus--Milstein (MM) schemes by combining stochastic Magnus integrators with Taylor…

A method for detecting intrinsic slow variables in high-dimensional stochastic chemical reaction networks is developed and analyzed. It combines anisotropic diffusion maps (ADM) with approximations based on the chemical Langevin equation…

Anderson mixing (AM) is an acceleration method for fixed-point iterations. Despite its success and wide usage in scientific computing, the convergence theory of AM remains unclear, and its applications to machine learning problems are not…

The augmented Lagrangian method (ALM) is a benchmark for convex programming problems with linear constraints; ALM and its variants for linearly equality-constrained convex minimization models have been well studied in the literature.…

We present a novel framework, namely AADMM, for acceleration of linearized alternating direction method of multipliers (ADMM). The basic idea of AADMM is to incorporate a multi-step acceleration scheme into linearized ADMM. We demonstrate…