Related papers: Solving Langevin equation with the bicolour rooted…
A general method is proposed which allows one to estimate drift and diffusion coefficients of a stochastic process governed by a Langevin equation. It extends a previously devised approach [R. Friedrich et al., Physics Letters A 271, 217…
The real-time contour formalism for Green's functions provides time-dependent information of quantum many-body systems. In practice, the long-time simulation of systems with a wide range of energy scales is challenging due to both the…
This paper considers the smooth bilevel optimization in which the lower-level problem is strongly convex and the upper-level problem is possibly nonconvex. We focus on the stochastic setting where the algorithm can access the unbiased…
This work considers the problem of learning the structure of multivariate linear tree models, which include a variety of directed tree graphical models with continuous, discrete, and mixed latent variables such as linear-Gaussian models,…
We study the treatment of the constraints in stochastic quantization method. We improve the treatment of the stochastic consistency condition proposed by Namiki et al. by suitably taking account of the Ito calculus. Then we obtain an…
The article is devoted to the construction of explicit one-step numerical methods with the strong orders of convergence 2.0, 2,5, and 3.0 for Ito stochastic differential equations with multidimensional non-commutative noise. We consider the…
We propose a method for efficiently incorporating constraints into a stochastic gradient Langevin framework for the training of deep neural networks. Constraints allow direct control of the parameter space of the model. Appropriately…
We derive and analyze numerical methods for underdamped (kinetic) Langevin dynamics in a domain with elastic reflection at the boundary. First-order approximations are based on an Euler-type scheme incorporating collision-handling at the…
Given a rooted tree T, the level ancestor problem aims to answer queries of the form LA(v, d), which identify the level d ancestor of a node v in the tree. Several algorithms of varied complexity have been proposed for this problem in the…
This paper proposes a new algorithm -- the \underline{S}ingle-timescale Do\underline{u}ble-momentum \underline{St}ochastic \underline{A}pprox\underline{i}matio\underline{n} (SUSTAIN) -- for tackling stochastic unconstrained bilevel…
Stochastic approximation is a class of algorithms that update a vector iteratively, incrementally, and stochastically, including, e.g., stochastic gradient descent and temporal difference learning. One fundamental challenge in analyzing a…
We revisit the problem of sampling from a target distribution that has a smooth strongly log-concave density everywhere in $\mathbb R^p$. In this context, if no additional density information is available, the randomized midpoint…
Recent rapid advances in single particle tracking and supercomputing techniques resulted in an unprecedented abundance of diffusion data exhibiting complex behaviours, such the presence of power law tails of the msd and memory functions,…
We examine the Langevin diffusion confined to a closed, convex domain $D\subset\mathbb{R}^d$, represented as a reflected stochastic differential equation. We introduce a sequence of penalized stochastic differential equations and prove that…
In this paper, we study the long-time stability behavior of a class of linear stochastic evolution equations in a Hilbert space with multiplicative noise. Explicit sufficient conditions for $p$-th moment and almost sure exponential…
Stochastic Gradient Langevin Dynamics (SGLD) ensures strong guarantees with regards to convergence in measure for sampling log-concave posterior distributions by adding noise to stochastic gradient iterates. Given the size of many practical…
Stochastic differential equations such as the Ornstein-Uhlenbeck process have long been used to model realworld probablistic events such as stock prices and temperature fluctuations. While statistical methods such as Maximum Likelihood…
Recent papers in solvable lattice models emphasize models where states can be visualized as colored paths through the lattice. We define a bosonic model in which there are two types of colors, one whose paths move down and to the right, the…
The Langevin equation accounts for unresolved bath degrees of freedom driving the system toward the bath temperature. Because of this, numerical solutions of the Langevin equation have a long history. Here, we recapitulate, combine, and…
The matching problem plays a basic role in combinatorial optimization and in statistical mechanics. In its stochastic variants, optimization decisions have to be taken given only some probabilistic information about the instance. While the…