Papers by Yifu Guo
TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling (2025.findings-emnlp)
Copied to clipboard
Jiahao Qiu, Yifu Lu, Yifan Zeng, Jiacheng Guo, Jiayi Geng, Chenhao Zhu, Xinzhe Juan, Ling Yang, Huazheng Wang, Kaixuan Huang, Yue Wu, Mengdi Wang
| Challenge: | Best-of-N (BoN) sampling generates multiple responses and selects the best one, achieving improved performance but with a high computational cost. |
| Approach: | They propose a framework that integrates a speculative tree-search strategy into Best-of-N (BoN) Sampling. |
| Outcome: | The proposed framework outperforms Best-of-N (BoN) sampling but has high computational cost . tree-search strategy reduces computational overhead while maintaining high output quality . |
Dynamic Parallel Tree Search for Efficient LLM Reasoning (2025.acl-long)
Copied to clipboard
Yifu Ding, Wentao Jiang, Shunyu Liu, Yongcheng Jing, Jinyang Guo, Yingjie Wang, Jing Zhang, Zengmao Wang, Ziwei Liu, Bo Du, Xianglong Liu, Dacheng Tao
| Challenge: | Recent methods focus on search accuracy while overlooking computational efficiency. |
| Approach: | They propose a parallelism framework that dynamically optimizes reasoning path in inference. |
| Outcome: | The proposed framework improves efficiency by 2-4 on average while maintaining or even surpassing existing reasoning algorithms in accuracy. |
DB-LLM: Accurate Dual-Binarization for Efficient LLMs (2024.findings-acl)
Copied to clipboard
Hong Chen, Chengtao Lv, Liang Ding, Haotong Qin, Xiabin Zhou, Yifu Ding, Xuebo Liu, Min Zhang, Jinyang Guo, Xianglong Liu, Dacheng Tao
| Challenge: | Existing methods for ultra-low bit quantization cause severe accuracy drops . a novel Dual-Binarization method is proposed for efficient Large Language Models . |
| Approach: | They propose a Dual-Binarization method that takes 2-bit-width and binarization into account . they propose DB-LLM, which uses a 2-bit binarized weighted model to represent weights efficiently . |
| Outcome: | The proposed method surpasses the current State-of-the-Art in ultra-low bit quantization and achieves 20% reduction in computational consumption compared to the SOTA method under the same bit-width. |
RepoShapley: Shapley-Enhanced Context Filtering for Repository-Level Code Completion (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models have strong reasoning, coding, and generation capabilities, but retrieval-augmented generation remains difficult under fixed context budgets. |
| Approach: | They propose a coalition-aware context filtering framework supervised by Shapley-style marginal contributions that captures sign effects via teacher-forced probing and computes exact Shaply values for small retrieval sets. |
| Outcome: | Experiments show that RepoShapley improves completion quality while reducing harmful context and unnecessary retrieval. |
RealMem: Benchmarking LLMs in Real-World Memory-Driven Interaction (2026.findings-acl)
Copied to clipboard
Haonan Bian, Zhiyuan Yao, Sen Hu, Zishan Xu, Shaolei Zhang, Yifu Guo, Ziliang Yang, Xueran Han, Huacan Wang, Ronghao Chen
| Challenge: | Existing benchmarks focus on casual conversation or task-oriented dialogue, failing to capture “long-term project-oriented” interactions where agents must track evolving goals. |
| Approach: | They propose a benchmark that simulates the dynamic evolution of memory in real-world projects. |
| Outcome: | The proposed benchmarks simulate the dynamic evolution of memory in real-world projects. |
From Experience to Skill: Multi-Agent Generative Engine Optimization via Reusable Strategy Learning (2026.findings-acl)
Copied to clipboard
Beining Wu, Fuyou Mao, Jiong Lin, Cheng Yang, Jiaxuan Lu, Yifu Guo, Siyu Zhang, Yifan Wu, Ying Huang, Fu Li
| Challenge: | Generative engines (GEs) are replacing ranked links with citation-grounded answers . current methods are unable to accumulate or transfer effective strategies across tasks and engines . |
| Approach: | They propose a multi-agent framework where planning, editing, and fidelity-aware evaluation serve as the execution layer. |
| Outcome: | The proposed framework outperforms heuristic baselines in visibility and citation fidelity on three mainstream engines. |
ACE-Router: Generalizing History-Aware Routing from MCP Tools to the Agent Web (2026.acl-long)
Copied to clipboard
Zhiyuan Yao, Zishan Xu, Yifu Guo, Zhiguang Han, Cheng Yang, Shuo Zhang, Weinan Zhang, Xingshan Zeng, Weiwen Liu
| Challenge: | Existing routers that use hardcoded tools are limited by scalability and generality bottlenecks. |
| Approach: | They propose a pipeline for training history-aware routers to empower precise navigation in large-scale ecosystems. |
| Outcome: | The proposed pipeline can train routers with dynamic context understanding to create the plug-and-play Light Routing Agent. |