An Information-theoretic Multi-task Representation Learning Framework for Natural Language Understanding

Dou Hu, Lingwei Wei, Wei Zhou, Songlin Hu
3/6/2025
cs.CLcs.ITcs.LG

No official code found. Best implementation: zerohd4869/InfoMTL (6 stars, last commit 2025-03-07).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

zerohd4869/InfoMTLCommunity100%

The official repository for AAAI 2025 paper "An Information-theoretic Multi-task Representation Learning Framework for Natural Language Understanding".

60Dec 31, 20241 years ago

Similar Papers

Cite this paper

@article{hu2025informationtheoretic,
  title  = {An Information-theoretic Multi-task Representation Learning Framework for Natural Language Understanding},
  author = {Dou Hu and Lingwei Wei and Wei Zhou and Songlin Hu},
  year   = {2025},
  eprint = {2503.04667},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.04667v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.04667.svg)](https://codeofpaper.com/paper/2503.04667)

Discussion