Abstract
Online learning with streaming data in a distributed and collaborative manner can be useful in a wide range of applications. This topic has been receiving considerable attention in recent years with emphasis on both single-task and multitask scenarios. In single-task adaptation, agents cooperate to track an objective of common interest, while in multitask adaptation agents track multiple objectives simultaneously. Regularization is one useful technique to promote and exploit similarity among tasks in the latter scenario. This paper examines an alternative way to model relations among tasks by assuming that they all share a common latent feature representation. As a result, a new multitask learning formulation is presented and algorithms are developed for its solution in a distributed online manner. We present a unified framework to analyze the mean-square-error performance of the adaptive strategies, and conduct simulations to illustrate the theoretical findings and potential applications.
Original language | English |
---|---|
Article number | 7859344 |
Pages (from-to) | 563-579 |
Number of pages | 17 |
Journal | IEEE Journal on Selected Topics in Signal Processing |
Volume | 11 |
Issue number | 3 |
DOIs | |
State | Published - Apr 2017 |
Keywords
- Collaborative processing
- common latent subspace
- diffusion strategy
- distributed optimization
- multitask learning
- online adaptation
- performance analysis