Published November 6, 2016
| Version v1
Conference paper
Distributed learning over multitask networks with linearly related tasks
- Others:
- Joseph Louis LAGRANGE (LAGRANGE) ; Université Nice Sophia Antipolis (1965 - 2019) (UNS) ; COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire de la Côte d'Azur ; COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Université Côte d'Azur (UCA)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)
- Ecole Polytechnique Fédérale de Lausanne (EPFL)
Description
In this work, we consider distributed adaptive learning over multitask mean-square-error (MSE) networks where each agent is interested in estimating its own parameter vector, also called task, and where the tasks at neighboring agents are related according to a set of linear equality constraints. We assume that each agent knows its own cost function of its vector and the set of constraints involving its vector. In order to solve the multitask problem and to optimize the individual costs subject to all constraints, a projection based diffusion LMS approach is derived and studied. Simulation results illustrate the efficiency of the strategy.
Abstract
International audience
Additional details
- URL
- https://hal.archives-ouvertes.fr/hal-03633792
- URN
- urn:oai:HAL:hal-03633792v1
- Origin repository
- UNICA