When does deep multi-task learning work for loosely related document classification tasks?
This work aims to contribute to our understanding of \textit{when} multi-task learning through parameter sharing in deep neural networks leads to improvements over single-task learning. We focus on the setting of learning from \textit{loosely related} tasks, for which no theoretical guarantees exist. We therefore approach the question empirically, studying which properties of datasets and single-task learning characteristics correlate with improvements from multi-task learning. We are the first to study this in a text classification setting and across more than 500 different task pairs.
Code (0)
등록된 구현이 없습니다.
Tasks
Document ClassificationGeneral ClassificationMachine TranslationMulti-Task LearningSentence CompressionSentiment Analysistext-classificationText ClassificationSimilar Papers 제목 키워드 기반
When Does Aggregating Multiple Skills with Multi-Task Learning Work? A Case Study in Financial NLP
Multi-task learning (MTL) aims at achieving a better model by leveraging data and knowledge from multiple tasks. However, MTL does not always work -- sometimes negative transfer occurs between tasks, especially when aggr…
DiversityMulti-Task LearningOpen-Ended Question AnsweringSentiment AnalysisTime-Optimal Transport of Loosely Placed Liquid Filled Cups along Prescribed Paths
Handling loosely placed objects with robotic manipulators is a difficult task from the point of view of trajectory planning and control. This becomes even more challenging when the object to be handled is a container fil…
Trajectory PlanningMultilingual Supervision of Semantic Annotation
In this paper, we investigate the annotation projection of semantic units in a practical setting. Previous approaches have focused on using parallel corpora for semantic transfer. We evaluate an alternative approach usin…
Question AnsweringRelation ExtractionSemantic ParsingSemantic Role Labeling+1Learning Loosely Connected Markov Random Fields
We consider the structure learning problem for graphical models that we call loosely connected Markov random fields, in which the number of short paths between any pair of nodes is small, and present a new conditional in…
Load Balancing in Large-Scale Heterogeneous Systems with Multiple Dispatchers
In recent years, the efficiency and even the feasibility of traditional load-balancing policies are challenged by the rapid growth of cloud infrastructure with increasing levels of server heterogeneity and increasing siz…