Papers by Xinran Wang
Accelerating LLM Reasoning via Early Rejection with Partial Reward Modeling (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are increasingly relied upon for solving complex reasoning tasks. |
| Approach: | They propose to use Process Reward Models to scale inference time compute by generating in parallel . they propose to provide early signals that enable the rejection of suboptimal candidates before full generation of step is complete. |
| Outcome: | The proposed method achieves 1.4 – 9 reduction in inference FLOPs without degrading final performance. |
Which Side Are You On? A Multi-task Dataset for End-to-End Argument Summarisation and Evaluation (2024.findings-acl)
Copied to clipboard
Hao Li, Yuping Wu, Viktor Schlegel, Riza Batista-Navarro, Tharindu Madusanka, Iqra Zahid, Jiayan Zeng, Xiaochi Wang, Xinran He, Yizhi Li, Goran Nenadic
| Challenge: | Recent advances in large language models (LLMs) have made it difficult to build an automated debate system that helps people to synthesise persuasive arguments. |
| Approach: | They propose to use an argument mining dataset to capture the end-to-end process of preparing an argumentative essay for a debate. |
| Outcome: | The proposed dataset shows that it performs better on individual tasks than on human-centred evaluations. |
PLAWBENCH: A Rubric-Based Benchmark for Evaluating LLMs in Real-World Legal Practice (2026.acl-long)
Copied to clipboard
Yuzhen Shi, Huanghai Liu, Yiran HU, Song Gaojie, Xu Xinran, Yubo Ma, Tianyi Tang, Li Zhang, Qingjing Chen, Feng Di, Wenbo Lv, Weiheng Wu, Kexin Yang, Sen Yang, Wei Wang, Rongyao Shi, Qiu Yuanyang, Yuemeng Qi, Zhang Jingwen, Sui Xiaoyu, Yifan Chen, Zhang Yi, An Yang, Bowen Yu, Dayiheng Liu, Junyang Lin, Weixing Shen, Bing Zhao, Charles L. A. Clarke, HU Wei
| Challenge: | Existing benchmarks for large language models (LLMs) are coarse, single-dimensional metrics and do not explicitly assess fine-grained legal reasoning. |
| Approach: | They propose a Practical Law Benchmark to evaluate large language models in real-world legal practice scenarios. |
| Outcome: | The proposed model is based on 850 questions and 13 scenarios with expert-designed evaluation rubrics. |
GAM: Hierarchical Graph-based Agentic Memory for LLM Agents (2026.acl-long)
Copied to clipboard
Zhaofen Wu, Hanrong Zhang, Fulin Lin, Wujiang Xu, Xinran Xu, Yankai Chen, Henry Peng Zou, Shaowen Chen, Weizhi Zhang, Xue Liu, Philip S. Yu, Hongwei Wang
| Challenge: | Current unified stream-based memory systems facilitate context updates but remain vulnerable to interference from transient noise. |
| Approach: | They propose a hierarchical Graph-based Agentic Memory framework that explicitly decouples memory encoding from consolidation to resolve conflict between rapid context perception and stable knowledge retention. |
| Outcome: | The proposed framework outperforms state-of-the-art benchmarks on LoCoMo and LongDialQA. |
Don’t Act Blindly: Robust GUI Automation via Action-Effect Verification and Self-Correction (2026.acl-long)
Copied to clipboard
Yuzhe Zhang, Xianwei Xue, Xingyong Wu, Mengke Chen, Chen Liu, Xinran He, Run Shao, Feiran Liu, Huanmin Xu, Qiutong Pan, Haiwei Wang
| Challenge: | Existing GUI agents assume deterministic environment responses, generating actions without verifying whether previous operations succeeded. |
| Approach: | They propose a GUI agent that explicitly models action outcomes and recovery under noisy environments. |
| Outcome: | The proposed agent reduces failure loops and improves recovery success in noisy environments while maintaining competitive standard task performance. |
On the Representation Geometry of LoRA Model Merging (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for low-rank Adaptation (LoRA) fine-tuning focus on globally shared structure . combining SVD with CUR improves performance of LoRA model merging . |
| Approach: | They propose a training-free method that combines SVD and CUR decomposition to improve LoRA merging performance. |
| Outcome: | The proposed procedure improves on vision and language benchmarks. |
Sem-DPO: Mitigating Semantic Inconsistency in Preference Optimization for Prompt Engineering (2026.findings-acl)
Copied to clipboard
Anas Mohamed, Azal Ahmad Khan, Xinran Wang, Ahmad Faraz Khan, Shuwen Ge, Saman Bahzad Khan, Ayaan Ahmad, Ali Anwar
| Challenge: | Direct Preference Optimization (DPO) is an off-policy alternative to RL for automatic prompt engineering, but its token-level regularization leaves semantic inconsistency unchecked as prompts that win higher preference scores can still drift away from the user’s intended meaning. |
| Approach: | They propose a variant of Direct Preference Optimization that preserves semantic consistency while maintaining its simplicity and efficiency. |
| Outcome: | The proposed model outperforms state-of-the-art prompt optimization baselines and several DPO variants on three standard text-to-image prompt-optimization benchmarks and three language models. |
Dense X Retrieval: What Retrieval Granularity Should We Use? (2024.emnlp-main)
Copied to clipboard
| Challenge: | a learned dense retrieval model is often overlooked when using a corpus for inference, resulting in a design choice of retrieval unit . granularity of retrievals is important for both retrieval and downstream tasks . |
| Approach: | They propose a retrieval unit for dense retrieval that uses propositions to index corpus . propositions are defined as atomic expressions within text, each encapsulating a distinct factoid . |
| Outcome: | The proposed retrieval unit outperforms passage-level units on retrieval and downstream tasks. |
AID: Adaptive Integration of Detectors for Safe AI with Language Models (2025.naacl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly used to generate human-like text, but safety concerns have emerged with the deployment of LLMs. |
| Approach: | They propose an approach that orchestrates the strengths of multiple pretrained detectors to ensure comprehensive effectiveness in diverse scenarios. |
| Outcome: | The proposed approach can improve the area under the curve (AUC) by 0.07 to 0.21, with a median of 0.12, compared to the best individual detectors developed for specific safety aspects. |
Graph-Based Chain-of-Thought Pruning for Reducing Redundant Reflections in Reasoning LLMs (2026.findings-acl)
Copied to clipboard
Hongyuan Yuan, Xinran He, Run Shao, Bolei He, Xianwei Xue, Mengke Chen, Qiutong Pan, Haiwei Wang, Haifeng Li
| Challenge: | Extending CoT through RL can induce undesirable thinking patterns such as overthinking . prior work has focused on inefficient reflection, which manifests in two problematic patterns: Indiscriminate Reflection and Repetitive Reflectione . |
| Approach: | They propose a graph-based approach to optimize CoT by pruning each linear CoT into a directed acyclic graph with explicit dependency edges. |
| Outcome: | The proposed approach reduces the average reasoning tokens by 42% while maintaining or improving accuracy. |
cAST: Enhancing Code Retrieval-Augmented Generation with Structural Chunking via Abstract Syntax Tree (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing line-based chunking heuristics often break semantic structures, splitting functions or merging unrelated code. |
| Approach: | They propose a structure-aware method that breaks large AST nodes into smaller chunks . this method generates self-contained, semantically coherent units across programming languages . |
| Outcome: | The proposed method boosts Recall@5 by 4.3 points on RepoEval retrieval and Pass@1 by 2.67 points on SWE-bench generation. |