Xiaoxuan Shen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiaoxuan Shen has a total of 77 co-authors. Here are the top co-authors by number of shared publications:
- Jianwen Sun
Central China Normal University
24 shared publications - Sannyuya Liu
Central China Normal University
14 shared publications - Qing Li
Central China Normal University, Wuhan, China
10 shared publications - Ruxia Liang
The National Engineering Research Center of Educational Big Data; the Faculty of Artificial Intelligence in Education, Central China Normal University, Wuhan, China
7 shared publications - Baolin Yi
Faculty of Artificial Intelligence in Education, Central China Normal University, Wuhan, China
6 shared publications - Qian Wan
Central China Normal University, Wuhan, China
6 shared publications
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 222-231
FASC: A Feature Aspect-Level Sentiment Consistency Framework for Explainable Recommendation Evaluation
Recent research in explainable recommendation commonly uses natural language explanations to improve transparency and user trust. However, reliably evaluating whether explanations are semantically faithful to users’ multi-dimensional preferences remains challenging. Existing methods mainly rely on text similarity metrics (e.g., BLEU, ROUGE) or shallow feature matching, which are insufficient for assessing whether explanations accurately reflect user preferences, especially in multi-aspect settings. To address these limitations, we propose Feature Aspect-Level Sentiment Consistency (FASC), a framework that quantifies semantic consistency between generated explanations and user-authored reference explanations through aspect coverage and sentiment polarity. FASC uses LLMs as auxiliary tools to extract structured aspect–sentiment units from explanation texts, enabling reproducible metrics for aspect coverage, correctness, and sentiment alignment. To validate the framework, we re-annotated several widely used explainable recommendation datasets to construct benchmarks with fine-grained, aspect-level sentiment labels. We further conducted human studies using pairwise comparisons, showing that FASC aligns more closely with human judgments than traditional metrics. Experimental results indicate that FASC can distinguish subtle differences in semantic faithfulness across models. To support future research, we release all annotated datasets and human evaluation results at https://github.com/YuChenfu1022/FASC.
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 222-231
Open AccessFASC: A Feature Aspect-Level Sentiment Consistency Framework for Explainable Recommendation Evaluation
Recent research in explainable recommendation commonly uses natural language explanations to improve transparency and user trust. However, reliably evaluating whether explanations are semantically faithful to users’ multi-dimensional preferences remains challenging. Existing methods mainly rely on text similarity metrics (e.g., BLEU, ROUGE) or shallow feature matching, which are insufficient for assessing whether explanations accurately reflect user preferences, especially in multi-aspect settings. To address these limitations, we propose Feature Aspect-Level Sentiment Consistency (FASC), a framework that quantifies semantic consistency between generated explanations and user-authored reference explanations through aspect coverage and sentiment polarity. FASC uses LLMs as auxiliary tools to extract structured aspect–sentiment units from explanation texts, enabling reproducible metrics for aspect coverage, correctness, and sentiment alignment. To validate the framework, we re-annotated several widely used explainable recommendation datasets to construct benchmarks with fine-grained, aspect-level sentiment labels. We further conducted human studies using pairwise comparisons, showing that FASC aligns more closely with human judgments than traditional metrics. Experimental results indicate that FASC can distinguish subtle differences in semantic faithfulness across models. To support future research, we release all annotated datasets and human evaluation results at https://github.com/YuChenfu1022/FASC.
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 838-843
The Underrated Catalyst: Advancing Critiquing Towards Steerable and Next-Generation LLM Recommendations.
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 838-843
Open AccessThe Underrated Catalyst: Advancing Critiquing Towards Steerable and Next-Generation LLM Recommendations.
- 16 September 2026
- Published by Elsevier in Neurocomputing
- Vol. 707
Affect-aware modeling of cognitive behavior for explainable knowledge tracing
- 16 September 2026
- Published by Elsevier in Neurocomputing
- Vol. 707
Affect-aware modeling of cognitive behavior for explainable knowledge tracing
- Open Access
Mitigating Overthinking in Large Reasoning Models via Difficulty-aware Reinforcement Learning
Large Reasoning Models (LRMs) achieve explicit chain-of-thought expansion by imitating deep thinking behaviors of humans, demonstrating excellent performance in complex task scenarios. However, the deep-thinking mode often leads to unnecessarily lengthy reasoning and resource inefficiency when handling simple tasks. This overthinking phenomenon may arise from the generation preference triggered by the reward function during post-training. Existing research attempts to mitigate overthinking from the perspective of prompt design or model training, but generally underestimates the importance of task difficulty awareness, which makes it difficult for LRMs to effectively allocate reasoning resources. In this paper, we propose Difficulty-aware Policy Optimization (DiPO), a reinforcement learning-based LRM training framework. DiPO encourages LRM to spontaneously model task complexity, and integrates them into reinforcement learning framework to adjust the generation preferences introduced by post-training. A difficulty modeling method based on model self-reasoning is proposed, which significantly reduces the dependence on manual annotation and formalize task complexity. We further develop a difficulty-signal-enhanced reward function that incorporates a penalty for lengthy reasoning while considering reasoning performance and output format. Experimental results indicate that DiPO enables the model to spontaneously adjust inference overhead, significantly reducing redundant tokens without losing performance due to thought compression.
Open AccessMitigating Overthinking in Large Reasoning Models via Difficulty-aware Reinforcement Learning
Large Reasoning Models (LRMs) achieve explicit chain-of-thought expansion by imitating deep thinking behaviors of humans, demonstrating excellent performance in complex task scenarios. However, the deep-thinking mode often leads to unnecessarily lengthy reasoning and resource inefficiency when handling simple tasks. This overthinking phenomenon may arise from the generation preference triggered by the reward function during post-training. Existing research attempts to mitigate overthinking from the perspective of prompt design or model training, but generally underestimates the importance of task difficulty awareness, which makes it difficult for LRMs to effectively allocate reasoning resources. In this paper, we propose Difficulty-aware Policy Optimization (DiPO), a reinforcement learning-based LRM training framework. DiPO encourages LRM to spontaneously model task complexity, and integrates them into reinforcement learning framework to adjust the generation preferences introduced by post-training. A difficulty modeling method based on model self-reasoning is proposed, which significantly reduces the dependence on manual annotation and formalize task complexity. We further develop a difficulty-signal-enhanced reward function that incorporates a penalty for lengthy reasoning while considering reasoning performance and output format. Experimental results indicate that DiPO enables the model to spontaneously adjust inference overhead, significantly reducing redundant tokens without losing performance due to thought compression.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2588-2598
ROKAN: Toward Interpretable and Domain-Robust Memory Behavior Modeling
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2588-2598
Open AccessROKAN: Toward Interpretable and Domain-Robust Memory Behavior Modeling