Disentangled and Robust Representation Learning for Bragging Classification in Social Media
Not on the map. Why?
Abstract (arXiv)
Researching bragging behavior on social media arouses interest of computational (socio) linguists. However, existing bragging classification datasets suffer from a serious data imbalance issue. Because labeling a data-balance dataset is expensive, most methods introduce external knowledge to improve model learning. Nevertheless, such methods inevitably introduce noise and non-relevance information from external knowledge. To overcome the drawback, we propose a novel bragging classification method with disentangle-based representation augmentation and domain-aware adversarial strategy. Specifically, model learns to disentangle and reconstruct representation and generate augmented features via disentangle-based representation augmentation. Moreover, domain-aware adversarial strategy aims to constrain domain of augmented features to improve their robustness. Experimental results demonstrate that our method achieves state-of-the-art performance compared to other methods.
Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Builds on 9 of its 25 references that are in the map. First posted on arXiv 27 Oct 2022.
Builds on
9 of 25 references.
References · 9
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,304
- 2014Adam: A Method for Stochastic Optimizationcited by 37,093
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,322
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,360
- 2020BERTweet: A pre-trained language model for English Tweetscited by 346
- 2019Dice Loss for Data-imbalanced NLP Taskscited by 181
- 2020JAKET: Joint Pre-training of Knowledge Graph and Language Understandingcited by 73
- 2021Domain-Aware Universal Style Transfercited by 40
- 2022Automatic Identification and Classification of Bragging in Social Mediacited by 12
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.