Distributed Multi-Task Relationship Learning
Sulin Liu, Sinno Jialin Pan, Qirong Ho

TL;DR
This paper introduces a distributed multi-task learning framework that learns task models and their relationships across geo-distributed data sources, addressing privacy and communication challenges with a novel optimization algorithm.
Contribution
It presents a general dual form for multi-task relationship learning and a communication-efficient primal-dual distributed optimization algorithm with convergence guarantees.
Findings
Effective in synthetic and real-world datasets
Reduces communication costs in distributed settings
Converges reliably as shown in experiments
Abstract
Multi-task learning aims to learn multiple tasks jointly by exploiting their relatedness to improve the generalization performance for each task. Traditionally, to perform multi-task learning, one needs to centralize data from all the tasks to a single machine. However, in many real-world applications, data of different tasks may be geo-distributed over different local machines. Due to heavy communication caused by transmitting the data and the issue of data privacy and security, it is impossible to send data of different task to a master machine to perform multi-task learning. Therefore, in this paper, we propose a distributed multi-task learning framework that simultaneously learns predictive models for each task as well as task relationships between tasks alternatingly in the parameter server paradigm. In our framework, we first offer a general dual form for a family of regularized…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Machine Learning and ELM · Sparse and Compressive Sensing Techniques
