Distributed Multitask Learning
classification
📊 stat.ML
cs.LG
keywords
distributedlearninglearnsmachinecentralizedcommunication-efficientcomparableconsider
read the original abstract
We consider the problem of distributed multi-task learning, where each machine learns a separate, but related, task. Specifically, each machine learns a linear predictor in high-dimensional space,where all tasks share the same small support. We present a communication-efficient estimator based on the debiased lasso and show that it is comparable with the optimal centralized method.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.