MAPL: Model Agnostic Peer-to-Peer Learning

Master Thesis (2023)
Author(s)

S. Mukherjee (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Contributor(s)

H Jamali-Rad – Mentor (TU Delft - Pattern Recognition and Bioinformatics)

J.C. van Gemert – Graduation committee member (TU Delft - Pattern Recognition and Bioinformatics)

G Leus – Graduation committee member (TU Delft - Signal Processing Systems)

Andrea Simonetto – Mentor (ENSTA Paris Institut Polytechnique de Paris)

Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright
© 2023 Sayak Mukherjee
More Info
expand_more
Publication Year
2023
Language
English
Copyright
© 2023 Sayak Mukherjee
Graduation Date
31-08-2023
Awarding Institution
Delft University of Technology
Programme
['Computer Science | Artificial Intelligence']
Faculty
Electrical Engineering, Mathematics and Computer Science
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Current methods in Federated and Decentralized learning presume that all clients share the same model architecture, assuming model homogeneity. However, in practice, this assumption may not always hold due to hardware differences. While prior research has addressed model heterogeneity in Federated Learning, it remains unexplored in fully decentralized or peer-to-peer settings. Therefore, in this paper, we investigate a real-world yet challenging situation involving model heterogeneity in a fully decentralized context. Furthermore, we introduced a Model Agnostic Peer-to-peer Learning (MAPL) framework, which allows simultaneous learning of heterogeneous personalized models. Additionally, we define a graph learning objective to infer optimal collaboration weights based on task similarity. Experiments reveal that even in this challenging scenario, MAPL delivers competitive results while being communication efficient owing to the sparse collaboration graph in both model homogeneous and heterogeneous settings.

Files

License info not available