Chengbing Wang
Author directory2026
From Empathy to Personalized Empathy: Adapting Empathetic Strategies to Individual Users
Wuqiang Zheng | Chengbing Wang | Yilin Yang | Junyi Cheng | Jianfei Xiao | Hu Sun | Yi Xie | Yangyang Li | Wenjie Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
Wuqiang Zheng | Chengbing Wang | Yilin Yang | Junyi Cheng | Jianfei Xiao | Hu Sun | Yi Xie | Yangyang Li | Wenjie Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
As Large Language Models (LLMs) are increasingly deployed in long-term interactions with users, empathy has become an increasingly important capability. However, existing research overlooks the influence of users’ personality traits on empathetic strategies during long-term interactions. To address this gap, we introduce the task of personalized empathy, which focuses on adapting empathetic strategies according to users’ personalized characteristics derived from history. To study and enhance this capability, we construct PersonaEmp, a personalized empathy dataset built from long-term user-AI interactions, featuring rich user histories, persona information, and empathy-seeking queries. We further propose PereGRM, a reward modeling framework that combines the empathy evaluation structure with dynamic evaluation criteria generation for fine-grained reward modeling. Experimental results across different settings and multiple judge models show that PereGRM consistently achieves the strongest performance improvements, indicating its effectiveness for enhancing personalized empathetic capabilities.
PERM: Psychology-grounded Empathetic Reward Modeling for Large Language Models
Chengbing Wang | Wuqiang Zheng | Yang Zhang | Fengbin Zhu | Junyi Cheng | Yi Xie | Wenjie Wang | Fuli Feng
Findings of the Association for Computational Linguistics: ACL 2026
Chengbing Wang | Wuqiang Zheng | Yang Zhang | Fengbin Zhu | Junyi Cheng | Yi Xie | Wenjie Wang | Fuli Feng
Findings of the Association for Computational Linguistics: ACL 2026
Large Language Models (LLMs) are increasingly deployed in human-centric applications, yet they often fail to provide substantive emotional support. While Reinforcement Learning (RL) has been utilized to enhance empathy of LLMs, existing reward models typically evaluate empathy from a single perspective, overlooking the inherently bidirectional interaction nature of empathy between the supporter and seeker as defined by Empathy Cycle theory. To address this limitation, we propose Psychology-grounded Empathetic Reward Modeling (PERM). PERM operationalizes empathy evaluation through a bidirectional decomposition: 1) Supporter perspective, assessing internal resonation and communicative expression; 2) Seeker perspective, evaluating emotional reception. Additionally, it incorporates a bystander perspective to monitor overall interaction quality. Extensive experiments on a widely-used emotional intelligence benchmark and an industrial daily conversation dataset demonstrate that PERM outperforms state-of-the-art baselines by over 10%. Furthermore, a blinded user study reveals a 70% preference for our approach, highlighting its efficacy in generating more empathetic responses.
2025
Decoding in Latent Spaces for Efficient Inference in LLM-based Recommendation
Chengbing Wang | Yang Zhang | Zhicheng Wang | Tianhao Shi | Keqin Bao | Fuli Feng | Tat-Seng Chua
Findings of the Association for Computational Linguistics: EMNLP 2025
Chengbing Wang | Yang Zhang | Zhicheng Wang | Tianhao Shi | Keqin Bao | Fuli Feng | Tat-Seng Chua
Findings of the Association for Computational Linguistics: EMNLP 2025
Fine-tuning large language models (LLMs) for recommendation in a generative manner has delivered promising results, but encounters significant inference overhead due to autoregressive decoding in the language space. This work explores bypassing language-space decoding by directly matching candidate items with the LLM’s internal thought representations in the latent space, eliminating the time-consuming autoregressive process to reduce computational costs. Towards this, we introduce Light Latent-space Decoding (L2D), an effective and efficient latent-space decoding method. L2D represents user-preferred items by using the hidden states of test sequences reflecting the LLM’s internal thought, and obtains candidate item representations from the hidden states of training sequences labeled with the corresponding candidate items. It then matches the two types of representations to decode items, achieving latent-space decoding. In this way, it enables efficient decoding without altering the LLM’s generative tuning paradigm, thereby preserving performance. Extensive empirical results demonstrate that L2D is more than 10x faster than language-space decoding while maintaining or enhancing performance.