Journal
MACHINE LEARNING
Volume 109, Issue 3, Pages 569-601Publisher
SPRINGER
DOI: 10.1007/s10994-019-05847-6
Keywords
Distributed learning; Multi-task learning; Acceleration
Categories
Funding
- NTU Singapore Nanyang Assistant Professorship (NAP) [M4081532.020]
- Singapore MOE AcRF Tier-2 Grant [MOE2016-T2-2-060]
Ask authors/readers for more resources
This work focuses on distributed optimization for multi-task learning with matrix sparsity regularization. We propose a fast communication-efficient distributed optimization method for solving the problem. With the proposed method, training data of different tasks can be geo-distributed over different local machines, and the tasks can be learned jointly through the matrix sparsity regularization without a need to centralize the data. We theoretically prove that our proposed method enjoys a fast convergence rate for different types of loss functions in the distributed environment. To further reduce the communication cost during the distributed optimization procedure, we propose a data screening approach to safely filter inactive features or variables. Finally, we conduct extensive experiments on both synthetic and real-world datasets to demonstrate the effectiveness of our proposed method.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available