Papers by Xikai Liu
2INER: Instructive and In-Context Learning on Few-Shot Named Entity Recognition (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Named Entity Recognition (NER) tasks are a fundamental task of natural language processing (NLP). |
| Approach: | They propose a text-to-text framework for Few-Shot Named Entity Recognition (NER) that employs instruction finetuning and auxiliary tasks to enhance the model's understanding of entity types in the overall semantic context of a sentence. |
| Outcome: | The proposed framework outperforms existing Few-Shot NER methods and remains competitive with state-of-the-art NER algorithms. |
Telling the Whole Story: A Manually Annotated Chinese Dataset for the Analysis of Humor in Jokes (D19-1)
Copied to clipboard
| Challenge: | Humor plays important role in human communication, which makes it important problem for natural language processing. |
| Approach: | They propose a novel annotation scheme to give scenarios of how humor arises in text . they report reasonable agreement between annotators and analyze the dataset . |
| Outcome: | The proposed scheme gives scenarios of how humor arises in text . it contains key words that trigger humor, character relationship, scene, and humor categories . |
Think-Search-Patch: A Retrieval-Augmented Reasoning Framework for Repository-Level Code Repair (2025.emnlp-industry)
Copied to clipboard
Bojian Xiong, Yikun Lei, Xikai Liu, Shaowei Zhang, Pengyun Zhu, Yan Liu, Yongqi Leng, Ling Shi, Meizhi Zhong, Yurong Zhang, Yan Gao, null Yiwu, Yao Hu, Deyi Xiong
| Challenge: | Large language models suffer from multiple-file coding scenarios with strong inter-file dependencies . experimental results show that large language models exhibit inadequate performance in multi-file scenarios . |
| Approach: | They propose a retrieval-augmented reasoning framework for repository-level code repair . they use a dataset to generate standardized patches based on the key snippets . |
| Outcome: | The proposed framework improves retrieval accuracy and repair success on SWE-bench Lite . it surpasses models with larger size in managing extensive code contexts and fixing bugs spanning across multiple files. |
DecEx-RAG: Boosting Agentic Retrieval-Augmented Generation with Decision and Execution Optimization via Process Supervision (2025.emnlp-industry)
Copied to clipboard
Yongqi Leng, Yikun Lei, Xikai Liu, Meizhi Zhong, Bojian Xiong, Yurong Zhang, Yan Gao, null Yiwu, Yao Hu, Deyi Xiong
| Challenge: | Recent advances in outcome-supervised reinforcement learning (RL) have shown strong performance, but this approach still suffers from inefficient exploration, sparse reward signals, and ambiguous global reward feedback. |
| Approach: | They propose a model that models RAG as a Markov Decision Process (MDP) and introduces an efficient pruning strategy to optimize data expansion. |
| Outcome: | The proposed model outperforms existing methods and achieves an average performance improvement of 6.2% across six datasets. |
Understanding the RoPE Extensions of Long-Context LLMs: An Attention Perspective (2025.coling-main)
Copied to clipboard
| Challenge: | Enabling LLMs to handle lengthy context is currently a research hotspot . a notable challenge limiting further customization is the inability of LLM to utilize context beyond pretrained length due to the inherent flaw of rotary position embedding (RoPE). |
| Approach: | They propose to extend the RoPE from an attention perspective and on two benchmarking tasks. |
| Outcome: | The proposed extension of the RoPE improves extrapolation and retrieval errors. |
ZigZagKV: Dynamic KV Cache Compression for Long-context Modeling based on Layer Uncertainty (2025.coling-main)
Copied to clipboard
| Challenge: | Existing methods to accelerate inference of Large Language models (LLMs) are limited in their ability to retain key tokens as input length increases. |
| Approach: | They propose a method that leverages layer uncertainty to allocate budget size for each layer to reduce memory usage. |
| Outcome: | The proposed method reduces memory usage of the KV caches to only 20% when compared to full KV inference while achieving nearly lossless performance. |