An Information-theoretic Multi-task Representation Learning Framework for Natural Language Understanding
Not on the map. Why?
Abstract (arXiv)
This paper proposes a new principled multi-task representation learning framework (InfoMTL) to extract noise-invariant sufficient representations for all tasks. It ensures sufficiency of shared representations for all tasks and mitigates the negative effect of redundant features, which can enhance language understanding of pre-trained language models (PLMs) under the multi-task paradigm. Firstly, a shared information maximization principle is proposed to learn more sufficient shared representations for all target tasks. It can avoid the insufficiency issue arising from representation compression in the multi-task paradigm. Secondly, a task-specific information minimization principle is designed to mitigate the negative effect of potential redundant features in the input for each task. It can compress task-irrelevant redundant information and preserve necessary information relevant to the target for multi-task prediction. Experiments on six classification benchmarks show that our method outperforms 12 comparative multi-task methods under the same multi-task settings, especially in data-constrained and noisy scenarios. Extensive experiments demonstrate that the learned representations are more sufficient, data-efficient, and robust.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 31 of its 50 references that are in the map. First posted on arXiv 6 Mar 2025.
Builds on
31 of 50 references.
References · 31
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
- 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
- 2020Gradient Surgery for Multi-Task Learningcited by 1,256
- 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 834
- 2018Multi-Task Learning as Multi-Objective Optimizationcited by 821
- 2015Deep Learning and the Information Bottleneck Principlecited by 802
- 2018End-to-End Multi-Task Learning with Attentioncited by 534
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
19 more
- 2016Cross-stitch Networks for Multi-task Learningcited by 467
- 2020TweetEval: Unified Benchmark and Comparative Evaluation for Tweet Classificationcited by 417
- 2019Multi-Task Deep Neural Networks for Natural Language Understandingcited by 350
- 2016Adversarial Training Methods for Semi-Supervised Text Classificationcited by 280
- 2019SemEval-2017 Task 4: Sentiment Analysis in Twittercited by 210
- 2019SemEval-2019 Task 6: Identifying and Categorizing Offensive Language in Social Media (OffensEval)cited by 207
- 2019Attentive Single-Tasking of Multiple Taskscited by 148
- 2023How Does Information Bottleneck Help Deep Learning?cited by 93
- 2017Nonlinear Information Bottleneckcited by 71
- 2016A Joint Many-Task Model: Growing a Neural Network for Multiple NLP Taskscited by 62
- 2019MultiNet++: Multi-Stream Feature Aggregation and Geometric Loss Strategy for Multi-Task Learningcited by 45
- 2020ANIMC: A Soft Framework for Auto-weighted Noisy and Incomplete Multi-view Clusteringcited by 30
- 2019Multi-task Learning for Aggregated Data using Gaussian Processescited by 20
- 2021Variational Multi-Task Learning with Gumbel-Softmax Priorscited by 15
- 2022VarMAE: Pre-training of Variational Masked Autoencoder for Domain-adaptive Language Understandingcited by 12
- 2020Multi-Task Variational Information Bottleneckcited by 7
- 2017Compression-Based Regularization with an Application to Multi-Task Learningcited by 2
- 2022Compressed Hierarchical Representations for Multi-Task Learning and Task Clusteringcited by 2
- 2024Representation Learning with Conditional Information Flow Maximizationcited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.