Papers by Yufei Sun
Modalities Should Be Appropriately Leveraged: Uncertainty Guidance for Multimodal Chinese Spelling Correction (2024.lrec-main)
Copied to clipboard
| Challenge: | Chinese spelling correction (CSC) aims to detect and correct spelling errors in Chinese texts. |
| Approach: | They propose a framework that incorporates uncertainty into feature learning and correction stages . they propose to combine the uncertainty of multimodal features with model learning . |
| Outcome: | The proposed framework improves on three public datasets. |
RubricBench: Aligning Model-Generated Rubrics with Human Standards (2026.acl-long)
Copied to clipboard
Junyi Zhou, Qiyuan Zhang, Yufei Wang, Fuyuan Lyu, Yidong Ming, Can Xu, Qingfeng Sun, Kai Zheng, Peng Kang, Xue Liu, Chen Ma
| Challenge: | Existing benchmarks lack discriminative complexity and ground-truth rubric annotations required for rigorous evaluation. |
| Approach: | They propose a curated benchmark with 1,147 pairwise comparisons to assess the reliability of rubric-based evaluation. |
| Outcome: | The proposed benchmarks show that they support diverse domains, exhibit discriminative ability, provide high-quality annotations, and include human-authored rubrics. |
CSMCIR: CoT-Enhanced Symmetric Alignment with Memory Bank for Composed Image Retrieval (2026.findings-acl)
Copied to clipboard
Zhipeng Qian, Zihan Liang, Yufei Ma, Ben Chen, Huangyu Dai, Yiwei Ma, Jiayi Ji, Chenyi Lei, Han Li, Xiaoshuai Sun
| Challenge: | Existing approaches to search for images using single-modality are limited by representation space fragmentation. |
| Approach: | They propose a unified representation framework that achieves efficient query-target alignment . they introduce a multi-level Chain-of-Thought prompting strategy that guides MLMs to generate discriminative, semantically compatible captions for target images . |
| Outcome: | The proposed framework achieves efficient query-target alignment through synergistic components. |
OpenEval: Benchmarking Chinese LLMs across Capability, Alignment and Safety (2024.acl-demos)
Copied to clipboard
Chuang Liu, Linhao Yu, Jiaxuan Li, Renren Jin, Yufei Huang, Ling Shi, Junhui Zhang, Xinmeng Ji, Tingting Cui, Liutao Liutao, Jinwang Song, Hongying Zan, Sun Li, Deyi Xiong
| Challenge: | a rapid development of Chinese large language models poses big challenges for efficient LLM evaluation. |
| Approach: | They propose an evaluation testbed that benchmarks Chinese LLMs across capability, alignment and safety. |
| Outcome: | The evaluation platform OpenEval benchmarks Chinese LLMs across capability, alignment and safety. |
Document Segmentation Matters for Retrieval-Augmented Generation (2025.findings-acl)
Copied to clipboard
Zhitong Wang, Cheng Gao, Chaojun Xiao, Yufei Huang, Shuzheng Si, Kangyang Luo, Yuzhuo Bai, Wenhao Li, Tangjian Duan, Chuancheng Lv, Guoshan Lu, Gang Chen, Fanchao Qi, Maosong Sun
| Challenge: | Existing rule-based chunking methods lead to suboptimal splits, where overly large chunks introduce irrelevant information and small chunks lack semantic coherence. |
| Approach: | They propose a method that leverages document summaries as pseudo-instructions to guide chunking by computing semantic similarity between sentences and the summary. |
| Outcome: | Experiments on multiple open-domain question-answering benchmarks show that PIC significantly improves retrieval accuracy (Hits@k) and end-to-end QA performance (Exact Match) without any additional training. |
How to Best Use Syntax in Semantic Role Labelling (P19-1)
Copied to clipboard
| Challenge: | Existing studies on integrating external information into NLP tasks focus on word-level shallow features such as POS or chunk tags. |
| Approach: | They propose to integrate syntactic information into a neural ELMo-based SRL sequence labelling model by using a constituency representation as input features. |
| Outcome: | The proposed approach improves performance on the in-domain CoNLL’05 and CoNll’12 benchmarks. |
TR-BERT: Dynamic Token Reduction for Accelerating BERT Inference (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing pre-trained language models (PLMs) are expensive in inference, making them impractical in resource-limited real-world applications. |
| Approach: | They propose a dynamic token reduction approach to accelerate PLMs' inference by adapting the layer number of each token to avoid redundant calculation. |
| Outcome: | The proposed approach speeds up BERT by 2-5 times and improves performance in long-text tasks with less computation. |
FastFiD: Improve Inference Efficiency of Open Domain Question Answering via Sentence Selection (2024.acl-long)
Copied to clipboard
| Challenge: | Open Domain Question Answering (ODQA) is a longstanding task in Natural Language Processing that involves generating an answer solely based on a given question. |
| Approach: | They propose a novel approach that executes sentence selection on the encoded passages to enhance the inference speed while reducing the context length required for generating answers. |
| Outcome: | The proposed approach can increase inference speed by **2.3X-5.7X** while maintaining the model’s performance. |
Evaluating Large Language Models on Controlled Generation Tasks (2023.emnlp-main)
Copied to clipboard
Jiao Sun, Yufei Tian, Wangchunshu Zhou, Nan Xu, Qian Hu, Rahul Gupta, John Wieting, Nanyun Peng, Xuezhe Ma
| Challenge: | Recent studies have looked into the ability of large language models in various benchmark tasks, including question generation, reading comprehension, multilingual and etc. However, few studies investigate the controllability of large languages. |
| Approach: | They propose to compare large language models with state-of-the-start finetuned smaller models to find that large language model controls are comparable to smaller models. |
| Outcome: | The proposed model can meet hard constraints and perform better than state-of-the-art models. |
GLTW: Joint Improved Graph Transformer and LLM via Three-Word Language for Knowledge Graph Completion (2025.findings-acl)
Copied to clipboard
Kangyang Luo, Yuzhuo Bai, Cheng Gao, Shuzheng Si, Zhu Liu, Yingli Shen, Zhitong Wang, Cunliang Kong, Wenhao Li, Yufei Huang, Ye Tian, Xuantang Xiong, Lei Han, Maosong Sun
| Challenge: | Existing knowledge graphs lack the ability to integrate structural information into LLMs and output predictions deterministically. |
| Approach: | They propose a method which encodes structural information of KGs and merges it with LLMs to enhance KGC performance. |
| Outcome: | The proposed method improves the performance of KG Completion datasets on KGs by integrating structural information with LLMs. |
PromDA: Prompt-based Data Augmentation for Low-Resource NLU Tasks (2022.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to build labeled training data from domain-specific data are expensive to obtain. |
| Approach: | They propose a Prompt-based Data Augmentation model which only trains small-scale Soft Promptes in frozen Pre-trained Language Models. |
| Outcome: | The proposed model outperforms several baseline models on four benchmarks and is complementary with unlabeled in-domain data. |
FPT: Improving Prompt Tuning Efficiency via Progressive Training (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Recent prompt tuning (PT) has gained increasing attention as a parameter-efficient way of tuning pre-trained language models (PLMs). |
| Approach: | They propose a prompt tuning algorithm that uses a small-scale partial PLM and progressively expands its depth and width until the full-model size. |
| Outcome: | The proposed method could save over 30% of training computations while achieving comparable performance. |
SkillVerse : Assessing and Enhancing LLMs with Tree Evaluation (2025.acl-long)
Copied to clipboard
| Challenge: | Language models evolve to tackle complex, multifaceted tasks, requiring granular evaluations . recent studies have focused on leaderboard and benchmark results, but limited interpretability makes it difficult to compare strengths and weaknesses of models. |
| Approach: | They propose an unsupervised tree-structured diagnosis framework for understanding model proficiency in specific abilities with an LLM as a judge. |
| Outcome: | The proposed framework improves model in-context learning and predicts model weaknesses with a 55% success rate compared to the framework without SkillVerse. |
Parsing into Variable-in-situ Logico-Semantic Graphs (2020.acl-main)
Copied to clipboard
| Challenge: | a new type of graph-based meaning representation allows analysis for scope-related phenomena. |
| Approach: | They propose variable-in-situ logico-semantic graphs to bridge gap between semantic graph and logical form parsing. |
| Outcome: | The proposed graph-based meaning representation achieves 92.39% accuracy in terms of elementary dependency match . the output of the proposed parser is highly coherent . |
Pre- and In-Parsing Models for Neural Empty Category Detection (P18-1)
Copied to clipboard
| Challenge: | Existing studies on empty category detection have shown positive effects on syntactic parsing . empty categories are used to indicate long-distance dependencies, discontinuous constituents, and certain dropped elements. |
| Approach: | They propose to use ECD to detect empty categories without syntactic analysis. |
| Outcome: | The proposed models outperform the prior state-of-the-art by significant margins. |
Paraphrase Generation as Unsupervised Machine Translation (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for paraphrase generation rely on labeled datasets or are limited in narrow domains. |
| Approach: | They propose a paradigm for paraphrase generation by treating the task as unsupervised machine translation based on pairs of unlabeled monolingual sentences. |
| Outcome: | The proposed paradigm can generate paraphrases on a large unlabeled monolingual corpus without relying on bilingual sentence pairs. |
Accurate SHRG-Based Semantic Parsing (P18-1)
Copied to clipboard
| Challenge: | Graph-structured semantic representations can encode rich semantic information of natural language sentences. |
| Approach: | They propose a SHRG-based parser that relates synchronous production rules to syntacto-semantic composition processes. |
| Outcome: | The proposed model improves on the best existing model by 4.87 points . it relates synchronous production rules to syntacto-semantic composition process . |
Rethinking Creativity Evaluation: A Critical Analysis of Existing Creativity Evaluations (2026.eacl-long)
Copied to clipboard
| Challenge: | Creativity measures that distinguish creativity in one domain fail in others, and different metrics disagree on the same data points. |
| Approach: | They examine, analyze, and compare four representative creativity measures across the diverse creative domains, including creative writing, unconventional problem-solving, and research ideation. |
| Outcome: | The measures of creativity across creative domains are compared using a set of human-aligned examples and lack consistency across domains and metrics. |
Beyond Length Scaling: Synergizing Breadth and Depth for Generative Reward Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent advances in Generative Reward Models have demonstrated that scaling the length of Chain-of-Thought reasoning enhances reliability of evaluation. |
| Approach: | They propose a framework that reconfigures raw rationales into structured Breadth-CoT and Depth-Co T through a modular synthesis pipeline. |
| Outcome: | The proposed framework surpasses open-source RMs by an average of 8.2%. |
HPSS: Heuristic Prompting Strategy Search for LLM Evaluators (2025.findings-acl)
Copied to clipboard
Bosi Wen, Pei Ke, Yufei Sun, Cunxiang Wang, Xiaotao Gu, Jinfeng Zhou, Jie Tang, Hongning Wang, Minlie Huang
| Challenge: | Existing efforts to optimize text evaluation prompts neglect the combinatorial impact of multiple factors, leading to insufficient optimization of the evaluation pipeline. |
| Approach: | They propose to integrate 8 key factors for evaluation prompts and integrate them into an algorithm that searches for well-behaved prompting strategies for LLM evaluators. |
| Outcome: | The proposed method outperforms existing methods and human-designed evaluation prompts on four evaluation tasks. |
Dipping PLMs Sauce: Bridging Structure and Text for Effective Knowledge Graph Completion via Conditional Soft Prompting (2023.findings-acl)
Copied to clipboard
| Challenge: | Knowledge Graph Completion (KGC) often requires both KG structural and textual information to be effective. |
| Approach: | They propose a system which tunes the parameters of Conditional Soft Prompts generated by entities and relations representations to maintain a balance between textual and structural knowledge. |
| Outcome: | The proposed components outperform baseline models on three static and temporal benchmarks. |