Yanbing Liu
Author directoryOther people with similar names: Yanbing Liu
Unverified author pages with similar names: Yanbing Liu
2026
MemGovern: Enhancing Code Agents through Learning from Governed Human Experiences
Qihao Wang | Ziming Cheng | Shuo Zhang | Fan Liu | Rui Xu | Heng Lian | Kunyi Wang | Xiaomin Yu | Jianghao Yin | Sen Hu | Yue Hu | Shaolei Zhang | Yanbing Liu | Ronghao Chen | Huacan Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
Qihao Wang | Ziming Cheng | Shuo Zhang | Fan Liu | Rui Xu | Heng Lian | Kunyi Wang | Xiaomin Yu | Jianghao Yin | Sen Hu | Yue Hu | Shaolei Zhang | Yanbing Liu | Ronghao Chen | Huacan Wang
Findings of the Association for Computational Linguistics: EMNLP 2026
While autonomous software engineering (SWE) agents are reshaping programming paradigms, they currently suffer from a “closed-world” limitation: they attempt to fix bugs from scratch or solely using information from the current repository, ignoring the immense historical human experience available on platforms like GitHub. Accessing this open-world experience is hindered by the unstructured and fragmented nature of real-world issue-tracking data. In this paper, we introduce MemGovern, a framework designed to govern and transform raw GitHub data into actionable experiential memory for agents. MemGovern employs experience governance to convert human experience into agent-friendly experience cards and introduces an agentic experience search strategy that enables logic-driven retrieval of human expertise. By producing 135K governed experience cards, MemGovern achieves a significant performance boost, improving resolution rates on the SWE-bench benchmark by 4.65%. As a plug-in approach, MemGovern provides a solution for agent-friendly memory infrastructure.
Conformal Event Prediction with Temporal Knowledge Graph
Cheng Hu | Cong Cao | Fangfang Yuan | Diandian Guo | Pin Xu | Yu Liu | Yanbing Liu
Findings of the Association for Computational Linguistics: ACL 2026
Cheng Hu | Cong Cao | Fangfang Yuan | Diandian Guo | Pin Xu | Yu Liu | Yanbing Liu
Findings of the Association for Computational Linguistics: ACL 2026
Event prediction plays a critical role in high-stakes applications such as military operations, public safety, and healthcare. Current methods learn temporal knowledge graphs to predict events at future timestamps, and the predictions directly influence decision-making and resource allocation. However, these methods lack rigorous uncertainty quantification, which limits their reliability for decision-making, especially in high-stakes scenarios where the cost of errors is high. In this paper, we propose CFEP, a conformal prediction framework tailored for event prediction to address this challenge. This is achieved through end-to-end optimization that ensures coverage while improving efficiency. Specifically, we first introduce non-conformity score diffusion, which captures both topological and temporal uncertainty in temporal knowledge graphs. Additionally, we propose an efficiency-aware optimization algorithm to reduce the coverage gap and improve computational efficiency. Experimental results on three public datasets demonstrate that our approach consistently guarantees statistical coverage while improving efficiency. The code and datasets are available at https://github.com/hucheng-IIE/CFEP.
Does Faithfulness-Guided Alignment Hurt Accuracy? Unlocking Accurate and Faithful Post-Retrieval Reasoning
Yu Liu | Wenxiao Zhang | Diandian Guo | Cong Cao | Fangfang Yuan | Qiang Sun | Yanbing Liu | Jin B. Hong | Zhiyuan Ma
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yu Liu | Wenxiao Zhang | Diandian Guo | Cong Cao | Fangfang Yuan | Qiang Sun | Yanbing Liu | Jin B. Hong | Zhiyuan Ma
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Retrieval-augmented generation (RAG) can achieve strong answer accuracy on multi-hop questions, but outcome-level rewards often leave reasoning traces weakly grounded and difficult to audit. Under noisy retrieval, models may exhibit right-answer-wrong-reason failures, where the final answer is correct but the supporting rationale exploits shortcuts or unsupported evidence. We therefore ask whether faithfulness-guided alignment hurts answer accuracy in post-retrieval reasoning. To study this question, we propose CRAFT (Calibrated Reasoning with Answer-Faithful Traces), a reinforcement learning framework for the response-generation stage of retrieval-augmented multi-hop question answering. CRAFT trains models to produce structured reasoning traces with configurable auditability, while combining deterministic rewards for format compliance, answer correctness, and citation validity with a judge-based reward for semantic faithfulness. Experiments across model scales and benchmarks show that CRAFT unlocks task-specific reasoning capacity from 1.5B upward, improving both answer accuracy and Faithfulness; at 0.5B, performance remains sharply template-dependent. At 7B, CRAFT improves Faithfulness over the Base model in all evaluated settings and remains competitive with strong closed-source models. Code is available at https://github.com/Ameame1/CRAFT.
EmoDap: Dual-Agent Prompt Retrieval Framework for Zero-Shot Fine-Grained Emotion Recognition
Kun Peng | Cong Cao | Hao Peng | Xiaoyan Yu | Zihao Wang | Lei Jiang | Yu Liu | Yanbing Liu | Philip S. Yu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Kun Peng | Cong Cao | Hao Peng | Xiaoyan Yu | Zihao Wang | Lei Jiang | Yu Liu | Yanbing Liu | Philip S. Yu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Zero-shot fine-grained emotion recognition (FER) is pivotal for empathetic AI but remains constrained by two inherent limitations in retrieval-augmented in-context learning (ICL): 1) subtle emotional distinctions inject semantic noise that blurs decision boundaries, and 2) naive similarity-based retrieval often surfaces counterproductive or antonymous demonstrations. To address these, we propose EmoDap, a dual-agent prompt retrieval framework for zero-shot FER. EmoDap first constructs a high-quality demonstration pool via self-consistency pseudo-labeling and derives explicit emotion prototypes through contrastive learning. Subsequently, a demonstration retriever and an emotion predictor are jointly optimized via Group Relative Policy Optimization (GRPO): the retriever learns to select examples that maximize the predictor’s accuracy, while the predictor leverages prototype guidance to dynamically filter candidate emotions. Extensive experiments across four benchmarks demonstrate that EmoDap consistently outperforms state-of-the-art baselines, establishing a robust paradigm for zero-shot FER driven by open-source LLM backbones.
Two Streams, One Sarcasm: Orthogonal Expert Tuning for Holistic Multimodal Sarcasm Understanding
Diandian Guo | Cong Cao | Fangfang Yuan | Pin Xu | Cheng Hu | Zhicheng Zhang | Yu Liu | Yanbing Liu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Diandian Guo | Cong Cao | Fangfang Yuan | Pin Xu | Cheng Hu | Zhicheng Zhang | Yu Liu | Yanbing Liu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Multimodal Sarcasm Understanding (MSU) comprises multiple subtasks, demanding both incongruity perception and intent reasoning. However, this progress is impeded by two bottlenecks. First, the lack of a unified benchmark for holistic satirical cognition hinders comprehensive evaluation of MSU. Second, jointly modeling these heterogeneous subtasks often leads to feature entanglement. Specifically, while subtasks share a dependence on incongruity, they diverge in granular focus, causing specific execution patterns to erode the fundamental perception capability. To address these challenges, we make two contributions. First, we introduce DocMSU-PLUS, a comprehensive benchmark covering five cognitive dimensions of MSU. All tasks are reformulated into multiple-choice questions (MCQs), enabling a unified accuracy-based evaluation. Second, we propose the Dual Orthogonal Stream Experts (DOSE) framework. DOSE structurally decouples experts into orthogonal shared perception and private execution streams to physically block gradient interference between tasks. Experiments demonstrate that DOSE achieves superior performance on DocMSU-PLUS, effectively balancing general perception with task-specific adaptation.
LitVISTA: A Benchmark for Narrative Orchestration in Literary Text
Mingzhe Lu | Yiwen Wang | Yanbing Liu | Qi You | Chong Liu | Ruize Qin | Haoyu Dong | Wenyu Zhang | JiaRui Zhang | Yue Hu | Yunpeng Li
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Mingzhe Lu | Yiwen Wang | Yanbing Liu | Qi You | Chong Liu | Ruize Qin | Haoyu Dong | Wenyu Zhang | JiaRui Zhang | Yue Hu | Yunpeng Li
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Computational narrative analysis aims to capture rhythm, tension, and emotional dynamics in literary texts. Existing large language models can generate long stories but overly focus on causal coherence, neglecting the complex story arcs and orchestration inherent in human narratives. This suggests a structural misalignment between model- and human-generated narratives.We therefore position narrative analysis as a diagnostic proxy for generation and propose VISTA Space, a high-dimensional framework for narrative orchestration that unifies human and model perspectives while jointly characterizing narrative function and structure in a common space.We further introduce LitVISTA, a structurally annotated benchmark grounded in literary texts, which operationalizes VISTA Space for systematic evaluation of models’ narrative orchestration capabilities. Under an oracle setting with gold event anchors, we evaluate frontier LLMs including GPT, Claude, Grok, and Gemini. Results reveal systematic deficiencies, as current models struggle to jointly capture narrative function and structure and fail to form an integrated global view of literary narrative orchestration. End-to-end analysis further shows that failures are dominated by anchor identification and localization errors. Even advanced thinking modes yield mixed and often limited gains for literary narrative understanding.
2025
Can We Steer Reasoning Direction by Thinking Intervention?
Xingsheng Zhang | Luxi Xing | Chen Zhang | Yanbing Liu | Yifan Deng | Yunpeng Li | Yue Hu | Chenxu Niu
Findings of the Association for Computational Linguistics: EMNLP 2025
Xingsheng Zhang | Luxi Xing | Chen Zhang | Yanbing Liu | Yifan Deng | Yunpeng Li | Yue Hu | Chenxu Niu
Findings of the Association for Computational Linguistics: EMNLP 2025
Large Reason Models (LRMs) extend long reasoning process to solve complex tasks. However, due to the lack of fine-grained control, they often suffer from overthinking and erroneous reasoning problems, risking accuracy loss. To address this issue, we introduce Reasoning Direction Steering (RDS) to enable fine-grained control over LRMs’ reasoning behaviors by aligning reasoning trajectories with specific cognitive patterns. We develop a simple yet effective paradigm, Thinking Intervention, which explores two key dimensions - intervention positions and intervention styles - to achieve integration intervention throughout model reasoning processes. To validate the effectiveness of our approach, we conduct comprehensive experiments on multi-hop question answering tasks using state-of-the-art LRMs, including Qwen3-Series and R1-Series models. Experimental results demonstrate the efficacy of Thinking Intervention with 9.4% average improvement on R1-Series models and 1.9% improvement on Qwen3-Series models.
Emotion Transfer with Enhanced Prototype for Unseen Emotion Recognition in Conversation
Kun Peng | Cong Cao | Hao Peng | Guanlin Wu | Zhifeng Hao | Lei Jiang | Yanbing Liu | Philip S. Yu
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Kun Peng | Cong Cao | Hao Peng | Guanlin Wu | Zhifeng Hao | Lei Jiang | Yanbing Liu | Philip S. Yu
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Current Emotion Recognition in Conversation (ERC) research follows a closed-domain assumption. However, there is no clear consensus on emotion classification in psychology, which presents a challenge for models when it comes to recognizing previously unseen emotions in real-world applications. To bridge this gap, we introduce the Unseen Emotion Recognition in Conversation (UERC) task for the first time and propose ProEmoTrans, a solid prototype-based emotion transfer framework. This prototype-based approach shows promise but still faces key challenges: First, implicit expressions complicate emotion definition, which we address by proposing an LLM-enhanced description approach. Second, utterance encoding in long conversations is difficult, which we tackle with a proposed parameter-free mechanism for efficient encoding and overfitting prevention. Finally, the Markovian flow nature of emotions is hard to transfer, which we address with an improved Attention Viterbi Decoding (AVD) method to transfer seen emotion transitions to unseen emotions. Extensive experiments on three datasets show that our method serves as a strong baseline for preliminary exploration in this new area.
Search
Fix author
Co-authors
- Cong Cao 5
- Yu Liu 4
- Diandian Guo 3
- Yue Hu 3
- Fangfang Yuan 3
- Cheng Hu 2
- Lei Jiang 2
- Yunpeng Li 2
- Hao Peng 2
- Kun Peng 2
- Pin Xu 2
- Philip S. Yu 2
- Ronghao Chen 1
- Ziming Cheng (程子鸣) 1
- Yifan Deng 1
- Haoyu Dong 1
- Zhifeng Hao 1
- Jin B. Hong 1
- Sen Hu 1
- Heng Lian 1
- Chong Liu 1
- Fan Liu 1
- Mingzhe Lu 1
- Zhiyuan Ma 1
- Chenxu Niu 1
- Ruize Qin 1
- Qiang Sun 1
- Huacan Wang 1
- Kunyi Wang 1
- Qihao Wang 1
- Yiwen Wang 1
- Zihao Wang 1
- Guanlin Wu 1
- Luxi Xing 1
- Rui Xu 1
- Jianghao Yin 1
- Qi You 1
- Xiaomin Yu 1
- Xiaoyan Yu 1
- Chen Zhang 1
- JiaRui Zhang 1
- Shaolei Zhang 1
- Shuo Zhang 1
- Wenxiao Zhang 1
- Wenyu Zhang 1
- Xingsheng Zhang 1
- Zhicheng Zhang 1