Papers by Xing Cui
ChatEdit: Towards Multi-turn Interactive Facial Image Editing via Dialogue (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to interactive facial image editing treat multi-turn editing as a sequence of successive single-turn edits, leading to attribute forgetting and error accumulation. |
| Approach: | They propose a framework for interactive facial image editing through dialogues based on the CelebA-HQ dataset and a benchmark dataset to evaluate this. |
| Outcome: | The proposed framework outperforms existing methods and improves existing ones. |
InsightEval: An Expert-Curated Benchmark for Assessing Insight Discovery in LLM-Driven Data Agents (2026.findings-acl)
Copied to clipboard
Zhenghao Zhu, Yuanfeng Song, Xing Chen, Chengzhong Liu, Cui Yakun, Caleb Chen Cao, Sirui Han, Yike Guo
| Challenge: | Existing frameworks for data analysis and insight exploration are lacking in terms of benchmarks . existing frameworks suffer from format inconsistencies, poorly conceived objectives, and redundant insights. |
| Approach: | They propose a data-curation pipeline to construct a new dataset named InsightEval. |
| Outcome: | The proposed benchmarks highlight prevailing challenges in automated insight discovery and raise key findings to guide future research. |
Stop Fixating on Prompts: Reasoning Hijacking and Constraint Tightening for Red-Teaming LLM Agents (2026.acl-long)
Copied to clipboard
| Challenge: | Existing red-team methods rely on modifying user prompts, which lack adaptability to new data and may impact the agent’s performance. |
| Approach: | They propose a framework that implicitly manipulates the agent’s reasoning trajectory and memory retrieval with three key stages: Trigger Extraction, Reasoning Hijacking, and Constraint Tightening. |
| Outcome: | The proposed framework shows outstanding performance in cross-model and cross-scenario environments. |
Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models (2025.findings-acl)
Copied to clipboard
Yingqian Cui, Pengfei He, Jingying Zeng, Hui Liu, Xianfeng Tang, Zhenwei Dai, Yan Han, Chen Luo, Jing Huang, Zhen Li, Suhang Wang, Yue Xing, Jiliang Tang, Qi He
| Challenge: | Chain-of-Thought (CoT) reasoning has improved the performance of large language models (LLMs) however, the detailed reasoning process in CoT often incurs long generation times and high computational costs due to the inclusion of unnecessary steps. |
| Approach: | They propose a method to identify critical reasoning steps using perplexity as a measure of their importance. |
| Outcome: | The proposed method achieves a better balance between reasoning accuracy and efficiency of CoT. |
Graph-Reward-SQL: Execution-Free Reinforcement Learning for Text-to-SQL via Graph Matching and Stepwise Reward (2025.findings-emnlp)
Copied to clipboard
Han Weng, Puzhen Wu, Cui Longjie, Yi Zhan, Boyi Liu, Yuanfeng Song, Dun Zeng, Yingxiang Yang, Qianru Zhang, Dong Huang, Xiaoming Yin, Yang Sun, Xing Chen
| Challenge: | Existing methods to enhance performance of large language models (LLMs) on Text-to-SQL tasks rely on execution-based or LLM-based reward models. |
| Approach: | They propose a reward model framework for RL-based Text-to-SQL that employs the GMNScore outcome reward model. |
| Outcome: | The proposed reward model outperforms existing reward models on standard benchmarks including Spider and BIRD. |
Sinkhorn Distance Minimization for Knowledge Distillation (2024.lrec-main)
Copied to clipboard
Xiao Cui, Yulei Qin, Yuting Gao, Enwei Zhang, Zihan Xu, Tong Wu, Ke Li, Xing Sun, Wengang Zhou, Houqiang Li
| Challenge: | Existing knowledge distillation methods investigate divergence measures but fail to deliver effective supervision when few distribution overlap exists between teacher and student. |
| Approach: | They propose a knowledge distillation method that exploits the Sinkhorn distance to ensure a nuanced assessment of the disparity between teacher and student distributions. |
| Outcome: | The proposed method outperforms state-of-the-art methods on all kinds of LLMs with encoder-only, encoder decoder, and decoded architectures. |
Retrieval Heads are Dynamic (2026.acl-long)
Copied to clipboard
Yuping Lin, Zitao Li, Yue Xing, Pengfei He, Yingqian Cui, Yaliang Li, Bolin Ding, Jingren Zhou, Jiliang Tang
| Challenge: | Recent studies have identified "retrieval heads" in Large Language Models responsible for extracting information from input contexts. |
| Approach: | They propose to examine retrieval heads from a dynamic perspective . they establish that retrieval head activation is highly dynamic and functionally irreplaceable . |
| Outcome: | The proposed model's hidden state encodes a predictive signal for future retrieval head patterns, indicating an internal planning mechanism. |
Boosting LLM’s Molecular Structure Elucidation with Knowledge Enhanced Tree Search Reasoning (2025.acl-long)
Copied to clipboard
Xiang Zhuang, Bin Wu, Jiyu Cui, Kehua Feng, Xiaotong Li, Huabin Xing, Keyan Ding, Qiang Zhang, Huajun Chen
| Challenge: | Molecular structure elucidation involves deducing a molecule’s structure from various types of spectral data, which is crucial in chemical experimental analysis. |
| Approach: | They propose a Knowledge-enhanced reasoning framework for Molecular Structure Elucidation that leverages Monte Carlo Tree Search for test-time scaling as a plugin to extend the LLMs’ coverage of the chemical structure space. |
| Outcome: | The proposed framework significantly improves on both GPT-4o-mini and GPT4o, and a specialized molecule-spectrum scorer improves performance. |
A Reward-Guided Dual-Phase Framework for Adaptive Inference-Time Reasoning (2026.findings-acl)
Copied to clipboard
Yingqian Cui, Zhenwei Dai, Pengfei He, Bing He, Hui Liu, Zhan Shi, Xianfeng Tang, Jingying Zeng, Suhang Wang, Yue Xing, Jiliang Tang, Benoit Dumoulin
| Challenge: | Large Language Models (LLMs) have made strong progress in reasoning. |
| Approach: | They propose a dual-phase test-time scaling framework that separates planning and execution and performs search over each phase independently. |
| Outcome: | Experiments on math reasoning and code generation benchmarks show that the proposed approach improves accuracy while reducing redundant computation. |