Representation Learning with Conditional Information Flow Maximization
<|reference_start|>Representation Learning with Conditional Information Flow Maximization: This paper proposes an information-theoretic representation learning framework, named conditional information flow maximization, to extract noise-invariant sufficient representations for the input data and target task. It promotes the learned representations have good feature uniformity and sufficient predictive ability, which can enhance the generalization of pre-trained language models (PLMs) for the target task. Firstly, an information flow maximization principle is proposed to learn more sufficient representations for the input and target by simultaneously maximizing both input-representation and representation-label mutual information. Unlike the information bottleneck, we handle the input-representation information in an opposite way to avoid the over-compression issue of latent representations. Besides, to mitigate the negative effect of potential redundant features from the input, we design a conditional information minimization principle to eliminate negative redundant features while preserve noise-invariant features. Experiments on 13 language understanding benchmarks demonstrate that our method effectively improves the performance of PLMs for classification and regression. Extensive experiments show that the learned representations are more sufficient, robust and transferable.<|reference_end|>
@article{hu2024representation,
    title={Representation Learning with Conditional Information Flow Maximization},
    author={Dou Hu, Lingwei Wei, Wei Zhou, Songlin Hu},
    journal={arXiv preprint arXiv:2406.05510},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.05510},
    primaryClass={cs.LG cs.CL}
}