March 27, 2024, 4:45 a.m. | Nicolo Dal Fabbro, Arman Adibi, H. Vincent Poor, Sanjeev R. Kulkarni, Aritra Mitra, George J. Pappas

stat.ML updates on arXiv.org arxiv.org

arXiv:2403.17247v1 Announce Type: cross
Abstract: We consider a setting in which $N$ agents aim to speedup a common Stochastic Approximation (SA) problem by acting in parallel and communicating with a central server. We assume that the up-link transmissions to the server are subject to asynchronous and potentially unbounded time-varying delays. To mitigate the effect of delays and stragglers while reaping the benefits of distributed computation, we propose \texttt{DASA}, a Delay-Adaptive algorithm for multi-agent Stochastic Approximation. We provide a finite-time analysis …

abstract acting agent agents aim approximation arxiv asynchronous cs.ai cs.ro cs.sy delay eess.sy math.oc multi-agent server stat.ml stochastic type

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

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne

Senior Machine Learning Engineer

@ Samsara | Canada - Remote

Machine Learning & Data Engineer - Consultant

@ Arcadis | Bengaluru, Karnataka, India