Time-varying convex optimization: Time-structured algorithms and applications
Optimization underpins many of the challenges that science and technology face on a daily
basis. Recent years have witnessed a major shift from traditional optimization paradigms …
basis. Recent years have witnessed a major shift from traditional optimization paradigms …
A survey on distributed online optimization and online games
Distributed online optimization and online games have been increasingly researched in the
last decade, mostly motivated by their wide applications in sensor networks, robotics (eg …
last decade, mostly motivated by their wide applications in sensor networks, robotics (eg …
: Decentralized Training over Decentralized Data
While training a machine learning model using multiple workers, each of which collects data
from its own data source, it would be useful when the data collected from different workers …
from its own data source, it would be useful when the data collected from different workers …
Cooperative and competitive multi-agent systems: From optimization to games
Multi-agent systems can solve scientific issues related to complex systems that are difficult or
impossible for a single agent to solve through mutual collaboration and cooperation …
impossible for a single agent to solve through mutual collaboration and cooperation …
An online convex optimization approach to proactive network resource allocation
Existing approaches to online convex optimization make sequential one-slot-ahead
decisions, which lead to (possibly adversarial) losses that drive subsequent decision …
decisions, which lead to (possibly adversarial) losses that drive subsequent decision …
Distributed online convex optimization with time-varying coupled inequality constraints
This paper considers distributed online optimization with time-varying coupled inequality
constraints. The global objective function is composed of local convex cost and …
constraints. The global objective function is composed of local convex cost and …
Social learning in multi agent multi armed bandits
A Sankararaman, A Ganesh, S Shakkottai - Proceedings of the ACM on …, 2019 - dl.acm.org
Motivated by emerging need of learning algorithms for large scale networked and
decentralized systems, we introduce a distributed version of the classical stochastic Multi …
decentralized systems, we introduce a distributed version of the classical stochastic Multi …
Byzantine-resilient multiagent optimization
We consider the problem of multiagent optimization wherein an unknown subset of agents
suffer Byzantine faults and thus behave adversarially. We assume that each agent i has a …
suffer Byzantine faults and thus behave adversarially. We assume that each agent i has a …
Central server free federated learning over single-sided trust social networks
Federated learning has become increasingly important for modern machine learning,
especially for data privacy-sensitive scenarios. Existing federated learning mostly adopts the …
especially for data privacy-sensitive scenarios. Existing federated learning mostly adopts the …
Distributed learning in the nonconvex world: From batch data to streaming and beyond
Distributed learning has become a critical enabler of the massively connected world that
many people envision. This article discusses four key elements of scalable distributed …
many people envision. This article discusses four key elements of scalable distributed …