Utilizing Redundancy in Cost Functions for Resilience in Distributed Optimization and Learning
Shuo Liu, Nirupam Gupta, Nitin Vaidya

TL;DR
This paper introduces a redundancy-based model to enhance the robustness of distributed optimization and learning algorithms against asynchronous and Byzantine faulty agents, improving their resilience through theoretical and empirical analysis.
Contribution
It proposes a novel $(f, r; \, \\epsilon)$-redundancy model to quantify and leverage redundancy among agents' cost functions for robustness.
Findings
Redundancy modeling improves robustness of DGD and D-SGD.
Theoretical analysis confirms resilience benefits.
Empirical results demonstrate practical effectiveness.
Abstract
This paper considers the problem of resilient distributed optimization and stochastic machine learning in a server-based architecture. The system comprises a server and multiple agents, where each agent has a local cost function. The agents collaborate with the server to find a minimum of their aggregate cost functions. We consider the case when some of the agents may be asynchronous and/or Byzantine faulty. In this case, the classical algorithm of distributed gradient descent (DGD) is rendered ineffective. Our goal is to design techniques improving the efficacy of DGD with asynchrony and Byzantine failures. To do so, we start by proposing a way to model the agents' cost functions by the generic notion of -redundancy where and are the parameters of Byzantine failures and asynchrony, respectively, and characterizes the closeness between agents' cost…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Privacy-Preserving Technologies in Data · Distributed Control Multi-Agent Systems
