Tchebycheff Procedure for Multi-task Text Classification
2020
Multi-task Learning methods have achieved great progress in text classification. However, existing methods assume that multi-task text classification problems are convex multiobjective optimization problems, which is unrealistic in real-world applications. To address this issue, this paper presents a novel Tchebycheff procedure to optimize the multi-task classification problems without convex assumption. The extensive experiments back up our theoretical analysis and validate the superiority of our proposals.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
21
References
4
Citations
NaN
KQI