Related papers: Stochastic approximations of set-valued dynamical …
We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios compared to the usual deterministic clustering setting.…
We consider SDEs driven by two different sources of additive noise, which we refer to as intrinsic and common. We establish almost sure existence and uniqueness of pullback attractors with respect to realisations of the common noise only.…
This paper studies the control-oriented identification problem of set-valued moving average systems with uniform persistent excitations and observation noises. A stochastic approximation-based (SA-based) algorithm without projections or…
We prove that deterministic motion in dissipative systems emerges as a strict geometric attractor of contact flow, not a statistical approximation. Building on the contact geometry of stochastic vector bundles, we develop time-dependent…
Assume that a stochastic processes can be approximated, when some scale parameter gets large, by a fluid limit (also called "mean field limit", or "hydrodynamic limit"). A common practice, often called the "fixed point approximation"…
An approach for the description of stochastic systems is derived. Some of the variables in the system are studied forward in time, others backward in time. The approach is based on a perturbation expansion in the strength of the coupling…
Stochastic versions of proximal methods have gained much attention in statistics and machine learning. These algorithms tend to admit simple, scalable forms, and enjoy numerical stability via implicit updates. In this work, we propose and…
We estimate the time a point or set, respectively, requires to approach the attractor of a radially symmetric gradient type stochastic differential equation driven by small noise. Here, both of these times tend to infinity as the noise gets…
First order optimization algorithms play a major role in large scale machine learning. A new class of methods, called adaptive algorithms, were recently introduced to adjust iteratively the learning rate for each coordinate. Despite great…
In the first part of the paper, we consider a discrete-time stochastic control system. We show that, under certain conditions, the set of random occupational measures generated by the state-control trajectories of the system as well as the…
This paper describes a forward algorithm and an adjoint algorithm for computing sensitivity derivatives in chaotic dynamical systems, such as the Lorenz attractor. The algorithms compute the derivative of long time averaged "statistical"…
It is shown that the time-averaged dynamics of memristors and their networks periodically driven by alternating-polarity pulses may converge to fixed-point attractors. Starting with a general memristive system model, we derive basic…
The usual Langevin approach to describe systems driven by noise fails to describe the long time behavior of systems with multiple attractors. The solution of the associated linear Fokker-Planck equation is always unique, even though it…
This paper introduces a new method to tackle the issue of the almost sure convergence of stochastic approximation algorithms defined from a differential inclusion. Under the assumption of slowly decaying step-sizes, we establish that the…
This paper is devoted to two different two-time-scale stochastic approximation algorithms for superquantile estimation. We shall investigate the asymptotic behavior of a Robbins-Monro estimator and its convexified version. Our main…
This paper compiles several aspects of the dynamics of stochastic approximation algorithms with Markov iterate-dependent noise when the iterates are not known to be stable beforehand. We achieve the same by extending the lock-in probability…
Mean field approximation is a popular method to study the behaviour of stochastic models composed of a large number of interacting objects. When the objects are asynchronous, the mean field approximation of a population model can be…
We introduce deterministic perturbation schemes for the recently proposed random directions stochastic approximation (RDSA) [17], and propose new first-order and second-order algorithms. In the latter case, these are the first second-order…
We analyze a stochastic approximation algorithm for decision-dependent problems, wherein the data distribution used by the algorithm evolves along the iterate sequence. The primary examples of such problems appear in performative prediction…
A stochastic algorithm is proposed, finding some elements from the set of intrinsic $p$-mean(s) associated to a probability measure $\nu$ on a compact Riemannian manifold and to $p\in[1,\infty)$. It is fed sequentially with independent…