# Multitask diffusion adaptation over networks with common latent representations

arXiv: https://arxiv.org/abs/1702.03614 · HTML: https://mlsanity.com/paper/1702.03614/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 13 Feb 2017.

## Built on by (most cited first, 3 of 3)

- [Projection-based QLP Algorithm for Efficiently Computing Low-Rank Approximation of Matrices](https://mlsanity.com/paper/2103.07245/) (2021)
- [Design and Analysis of Robust Resilient Diffusion over Multi-Task Networks Against Byzantine Attacks](https://mlsanity.com/paper/2206.12749/) (2022)
- [S3LDBO: A Snapshot Single-Loop Algorithm for Decentralized Bilevel Optimization](https://mlsanity.com/paper/2605.31311/) (2026)

## Abstract (arXiv)

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 work 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.