Papers by Xudong Guo
LoopCoder: Scaling Code Intelligence via Looped Language Models (2026.findings-acl)
Copied to clipboard
Jian Yang, Wei Zhang, Shuyue Guo, Yizhi LI, Linzheng Chai, Zhengmao Ye, Shukai Liu, Yuyang Song, Jiajun Wu, Che Liu, Tianyu Zheng, Siwei Wu, Leo L, Xudong Ma, Chuan Hao, Ran Tao, Yan Xing, Jianzhou Wang, Mingjie Tang, Aishan Liu, Zhoujun Li, Xianglong Liu, Weifeng Lv, Bryan Dai
| Challenge: | Large language models have mastered syntax-level code generation, but complex algorithmic reasoning remains a challenge. |
| Approach: | They propose a recurrent inductive bias that aligns with the recursive nature of programming logic. |
| Outcome: | The proposed model achieves comparable performance to standard dense models with more parameters. |
LIST: Linearly Incremental SQL Translator for Single-Hop Reasoning, Generation and Verification (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing schema linking methods are not able to handle complex SQL queries. |
| Approach: | They propose a new algorithm that transforms SQL queries into grammatically verifiable sub-queries which are arranged sequentially to reflect single-hop reasoning steps. |
| Outcome: | The proposed algorithm achieves significant performance gains on the BIRD dataset and surpasses schema linking methods at comparable or better cost. |
DeepPlanning: Benchmarking Long-Horizon Agentic Planning with Verifiable Constraints (2026.acl-long)
Copied to clipboard
Yinger Zhang, Shutong Jiang, Renhao Li, Jianhong Tu, Yang Su, Lianghao Deng, Xudong Guo, ChenXu Lv, Junyang Lin
| Challenge: | Existing LLM planning benchmarks emphasize local, step-level reasoning rather than global constrained optimization. |
| Approach: | They propose a benchmark for practical long-horizon agent planning that uses local constrained reasoning and global constrained optimization. |
| Outcome: | The proposed benchmarks show that even frontier agentic LLMs struggle with these problems. |
MemPO: Self-Memory Policy Optimization for Long-Horizon Agents (2026.findings-acl)
Copied to clipboard
Ruoran Li, Xinghua Zhang, Haiyang Yu, Shitong Duan, Xiang Li, Wenxin Xiang, Chonghua Liao, Xudong Guo, Yongbin Li, Jinli Suo
| Challenge: | Existing methods for long-horizon agents introduce the external memory module and look up the relevant information from the stored memory, which prevents the model from proactively managing its memory content and aligning with the agent’s overarching task objectives. |
| Approach: | They propose an algorithm which enables agents to autonomously manage their memory during interaction with environment and selectively retain crucial information. |
| Outcome: | Extensive experiments show that the proposed algorithm achieves absolute F1 score gains of 25.98 over the base model and 7.1 over the previous SOTA baseline while preserving task performance. |