mlsanityData to 14 Oct 2026

Dynamic Domain Information Modulation Algorithm for Multi-domain Sentiment Analysis

arXiv 2505.06630 ↗First posted 10 May 2025cs.CL cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Multi-domain sentiment classification aims to mitigate poor performance models due to the scarcity of labeled data in a single domain, by utilizing data labeled from various domains. A series of models that jointly train domain classifiers and sentiment classifiers have demonstrated their advantages, because domain classification helps generate necessary information for sentiment classification. Intuitively, the importance of sentiment classification tasks is the same in all domains for multi-domain sentiment classification; but domain classification tasks are different because the impact of domain information on sentiment classification varies across different fields; this can be controlled through adjustable weights or hyper parameters. However, as the number of domains increases, existing hyperparameter optimization algorithms may face the following challenges: (1) tremendous demand for computing resources, (2) convergence problems, and (3) high algorithm complexity. To efficiently generate the domain information required for sentiment classification in each domain, we propose a dynamic information modulation algorithm. Specifically, the model training process is divided into two stages. In the first stage, a shared hyperparameter, which would control the proportion of domain classification tasks across all fields, is determined. In the second stage, we introduce a novel domain-aware modulation algorithm to adjust the domain information contained in the input text, which is then calculated based on a gradient-based and loss-based method. In summary, experimental results on a public sentiment analysis dataset containing 16 domains prove the superiority of the proposed method.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 59 references that are in the map. First posted on arXiv 10 May 2025.

Builds on

21 of 59 references.

References · 21

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  4. 2014Explaining and Harnessing Adversarial Examplescited by 7,364
  5. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  6. 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,367
  7. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  8. 2020Gradient Surgery for Multi-Task Learningcited by 1,256
  9. 2018A Tutorial on Bayesian Optimizationcited by 744
  10. 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 459
  11. 2020A Survey of Convolutional Neural Networks: Analysis, Applications, and Prospectscited by 397
  12. 2024xLSTM: Extended Long Short-Term Memorycited by 327
9 more
  1. 2016Adversarial Training Methods for Semi-Supervised Text Classificationcited by 280
  2. 2021Recent Advances in Adversarial Training for Adversarial Robustnesscited by 279
  3. 2024The Illusion of State in State-Space Modelscited by 187
  4. 2023Towards Building the Federated GPT: Federated Instruction Tuningcited by 185
  5. 2017Adversarial Multi-task Learning for Text Classificationcited by 91
  6. 2021RotoGrad: Gradient Homogenization in Multitask Learningcited by 83
  7. 2020Provably Efficient Online Hyperparameter Optimization with Population-Based Banditscited by 63
  8. 2019Multi-task Learning for Multi-modal Emotion Recognition and Sentiment Analysiscited by 39
  9. 2023Scalarization for Multi-Task and Multi-Domain Learning at Scalecited by 19

Built on by

Not cited yet.