May 15, 2023, 12:43 a.m. | Adrian Redder, Arunselvan Ramaswamy, Holger Karl

cs.LG updates on arXiv.org arxiv.org

We generalize the Borkar-Meyn stability Theorem (BMT) to distributed
stochastic approximations (SAs) with information delays that possess an
arbitrary moment bound. To model the delays, we introduce Age of Information
Processes (AoIPs): stochastic processes on the non-negative integers with a
unit growth property. We show that AoIPs with an arbitrary moment bound cannot
exceed any fraction of time infinitely often. In combination with a suitably
chosen stepsize, this property turns out to be sufficient for the stability of
distributed SAs. …

age arxiv convergence distributed growth information math negative processes property sas show stochastic theorem

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

DevOps Engineer (Data Team)

@ Reward Gateway | Sofia/Plovdiv