Name
Abstract | ||
|---|---|---|
Although dispersing one single task to distributed learning nodes has been intensively studied by the previous research, multi-task learning on distributed networks is still an area that has not been fully exploited, especially under decentralized settings. The challenge lies in the fact that different tasks may have different optimal learning weights while communication through the distributed network forces all tasks to converge to an unique classifier. In this paper, we present a novel algorithm to overcome this challenge and enable learning multiple tasks simultaneously on a decentralized distributed network. Specifically, the learning framework can be separated into two phases: (i) multi-task information is shared within each node on the first phase; (ii) communication between nodes then leads the whole network to converge to a common minimizer. Theoretical analysis indicates that our algorithm achieves a regret bound when compared with the best classifier in hindsight, which is further validated by experiments on both synthetic and real-world datasets. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10994-017-5676-y | Machine Learning |
Keywords | Field | DocType |
Decentralized distributed learning,Multi-task learning,Online learning | Online learning,E learning,Multi-task learning,Regret,Optimal learning,Distributed learning,Artificial intelligence,Classifier (linguistics),Hindsight bias,Mathematics,Machine learning | Journal |
Volume | Issue | ISSN |
107 | 4 | 0885-6125 |
Citations | PageRank | References |
2 | 0.36 | 19 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chi Zhang | 1 | 6 | 1.78 |
| Peilin Zhao | 2 | 1365 | 80.09 |
| Shuji Hao | 3 | 110 | 6.57 |
| Yeng Chai Soh | 4 | 1777 | 155.44 |
| Bu-Sung Lee | 5 | 2119 | 140.18 |
| Chunyan Miao | 6 | 2307 | 195.72 |
| Steven C. H. Hoi | 7 | 268 | 17.70 |