Papers by Shunyu Liu
A Regularization-based Transfer Learning Method for Information Extraction via Instructed Graph Decoder (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for information extraction (IE) focus on training task-specific models, while common knowledge among different IE tasks is not explicitly modeled. |
| Approach: | They propose a regularization-based transfer learning method for IE via an instructed graph decoder which decodes various complex structures into a graph uniformly based on corresponding instructions. |
| Outcome: | The proposed method can learn common knowledge from existing datasets and transfer it to a new dataset with new labels. |
Dynamic Parallel Tree Search for Efficient LLM Reasoning (2025.acl-long)
Copied to clipboard
Yifu Ding, Wentao Jiang, Shunyu Liu, Yongcheng Jing, Jinyang Guo, Yingjie Wang, Jing Zhang, Zengmao Wang, Ziwei Liu, Bo Du, Xianglong Liu, Dacheng Tao
| Challenge: | Recent methods focus on search accuracy while overlooking computational efficiency. |
| Approach: | They propose a parallelism framework that dynamically optimizes reasoning path in inference. |
| Outcome: | The proposed framework improves efficiency by 2-4 on average while maintaining or even surpassing existing reasoning algorithms in accuracy. |
RubricHub: A Comprehensive and Highly Discriminative Rubric Dataset via Automated Coarse-to-Fine Generation (2026.acl-long)
Copied to clipboard
Sunzhu Li, Jiale Zhao, Huimin Ren, Zhenlin Wei, Yang Zhou, Jingwen Yang, Shunyu Liu, Kaike Zhang, Chen Wei
| Challenge: | Existing methods for generating open-ended rubrics suffer from scalability bottlenecks and coarse criteria resulting in a supervision ceiling effect. |
| Approach: | They propose a framework for automated Coarse-to-Fine Rubric Generation . their framework uses principle-guided synthesis, multi-model aggregation, difficulty evolution . |
| Outcome: | The proposed framework produces comprehensive and highly discriminative criteria capable of capturing the subtle nuances. |
Let’s Rectify Step by Step: Improving Aspect-based Sentiment Analysis with Diffusion Models (2024.lrec-main)
Copied to clipboard
| Challenge: | Empirical evaluations conducted on eight benchmark datasets underscore the compelling advantages offered by DiffusionABSA when compared against robust baseline models. |
| Approach: | They propose a diffusion model which extracts aspects step by step and learns a denoising process that progressively restores them in a reverse manner. |
| Outcome: | Empirical evaluations on eight benchmark datasets underscore the compelling advantages offered by DiffusionABSA when compared against robust baseline models. |
Reasoning-Guided Exploration for Online DPO (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent work has aimed to enhance reasoning capabilities of language models, but these methods are limited to domains with objectively verifiable answers. |
| Approach: | They propose a self-play framework to improve reasoning on general-domain data. |
| Outcome: | Experiments show that the proposed framework improves reasoning performance on general-domain data while maintaining competitive performance on verifiable academic benchmarks. |
Knowledge Enhanced Pre-training for Cross-lingual Dense Retrieval (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing mPLMs neglect the importance of knowledge in cross-lingual dense retrieval. |
| Approach: | They propose a novel mPLM that leverages knowledge to learn language-agnostic semantic representations from a multilingual knowledge base and an annotation of Wiki. |
| Outcome: | The proposed model achieves strong multilingual and cross-lingual retrieval performance with significant improvements over existing mPLMs. |
Supervised Optimism Correction: Be Confident When LLMs Are Sure (2025.findings-acl)
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have demonstrated remarkable success across diverse tasks such as instruction following, code generation, and medical diagnosis. |
| Approach: | They propose a supervised fine-tuning-based auxiliary loss for Q-value estimations during supervised refinement. |
| Outcome: | The proposed method outperforms beam search on GSM8K, MATH, and GAOKAO on reasoning benchmarks. |
Contextual Experience Replay for Self-Improvement of Language Agents (2025.acl-long)
Copied to clipboard
| Challenge: | Existing large language model (LLM) agents fail in complex tasks without any environment-specific experiences. |
| Approach: | They propose a framework that accumulates and synthesizes past experiences into a dynamic memory buffer to enable efficient self-improvement for language agents in their context window. |
| Outcome: | The proposed framework improves performance on WebArena and VisualWebAren . it surpasses tree search method with fewer token costs and achieves state-of-the-art performance of 31.9%. |