A coded multi-task learning scheme is claimed to achieve optimal communication loads under a mild data-placement condition, but the optimality proof applies a lower bound that is invalid for the general number of data batches.
Mapreduce: simplified data processing on large clusters,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Novel Coded Computing Approach for Distributed Multi-Task Learning
A coded multi-task learning scheme is claimed to achieve optimal communication loads under a mild data-placement condition, but the optimality proof applies a lower bound that is invalid for the general number of data batches.