Proximally Regularized Multitask Learning over Networks
We consider a collection of intelligent agents with the objective of learning distinct, but related tasks. Classical algorithms for federated and decentralized learning employ consensus mechanisms to learn a single, common model across the different agents and tasks. In recent years, there has been increasing interest in multitask or meta-learning techniques to develop personalized learning algorithms over networks, though most studies focus on the federated setting with single fusion center. We develop a fully decentralized strategy for personalized learning over networks based on proximal regularization and explore relations with alternatives based on quadratic regularization or meta-learning. Numerical results demonstrate the benefit of the proposed approach.
Authors
- Roula Nassif (ORCID: https://orcid.org/0000-0001-9663-8559)
- Stefan Vlaski (ORCID: https://orcid.org/0000-0002-0616-3076)
Institutions
- Imperial College London (GB)
Publication Details
- Published
- 2024-10-27
- DOI
- https://doi.org/10.1109/ieeeconf60004.2024.10943086
- Primary Topic
- Machine Learning and ELM
- Type
- article
- Field-Weighted Citation Impact
- 0.00