|Byzantine Resilient Distributed Multi-Task Learning
Distributed multi-task learning provides significant advantages in multi-agent networks with heterogeneous data sources where agents aim to learn distinct but correlated models simultaneously. However, distributed algorithms for learning relatedness among tasks are not resilient in the presence of Byzantine agents. In this paper, we present an approach for Byzantine resilient distributed multi-task learning. We propose an efficient online weight assignment rule by measuring the accumulated loss using an agent s data and its neighbors models.
|Year of Publication
34th International Conference on Neural Information Processing Systems
Curran Associates Inc.
Red Hook, NY, USA
|Google Scholar | BibTeX | XML