activity
20102026
most citedRainbow Connection Number and Radius

13 citations · 38 across the 16 of their papers we have counts for

collaborators
Showing math.OCShow all

6 papers · 1 filter

math.OC2026

Distributed Stochastic Approximation Algorithms and Heavy-Tailed Age of Information

Adrian Redder, Arunselvan Ramaswamy, Holger Karl

Algorithms in multi-agent systems such as federated learning, mobile robotic swarming, and consensus control can be designed and analyzed as distributed stochastic approximation al…

math.OC2023★ 1 cited

Stability and Convergence of Distributed Stochastic Approximations with large Unbounded Stochastic Information Delays

Adrian Redder, Arunselvan Ramaswamy, Holger Karl

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 de…

math.OC2022

Distributed gradient-based optimization in the presence of dependent aperiodic communication

Adrian Redder, Arunselvan Ramaswamy, Holger Karl

Iterative distributed optimization algorithms involve multiple agents that communicate with each other, over time, in order to minimize/maximize a global objective. In the presence…

math.OC2021

Practical sufficient conditions for convergence of distributed optimisation algorithms over communication networks with interference

Adrian Redder, Arunselvan Ramaswamy, Holger Karl

Information exchange over networks can be affected by various forms of delay. This causes challenges for using the network by a multi-agent system to solve a distributed optimisati…

math.OC2019

DSPG: Decentralized Simultaneous Perturbations Gradient Descent Scheme

Arunselvan Ramaswamy

Distributed descent-based methods are an essential toolset to solving optimization problems in multi-agent system scenarios. Here the agents seek to optimize a global objective fun…

math.OC2018

Asynchronous stochastic approximations with asymptotically biased errors and deep multi-agent learning

Arunselvan Ramaswamy, Shalabh Bhatnagar, Daniel E. Quevedo

Asynchronous stochastic approximations (SAs) are an important class of model-free algorithms, tools and techniques that are popular in multi-agent and distributed control scenarios…