Poster
Byzantine Resilient and Fast Federated Few-Shot Learning
Ankit Pratap Singh · Namrata Vaswani
Hall C 4-9 #2507
[
Abstract
]
Tue 23 Jul 2:30 a.m. PDT
— 4 a.m. PDT
Abstract:
This work introduces a Byzantine resilient solution for learning low-dimensional linear representation. Our main contribution is the development of a provably Byzantine-resilient AltGDmin algorithm for solving this problem in a federated setting. We argue that our solution is sample-efficient, fast, and communicationefficient. In solving this problem, we also introduce a novel secure solution to the federated subspace learning meta-problem that occurs in many different applications.
Live content is unavailable. Log in and register to view live content