Papers by Yu-Feng Li
TabularMath: Understanding Math Reasoning over Tables with Large Language Models (2026.findings-acl)
Copied to clipboard
| Challenge: | Mathematical reasoning has long been a key benchmark for evaluating large language models. |
| Approach: | They propose a framework that transforms math word problems into scalable tabular reasoning tasks. |
| Outcome: | The proposed framework transforms math word problems into scalable and verified tabular reasoning tasks. |
EvolveSearch: An Iterative Self-Evolving Search Agent (2025.emnlp-main)
Copied to clipboard
Ding-Chu Zhang, Yida Zhao, Jialong Wu, Liwen Zhang, Baixuan Li, Wenbiao Yin, Yong Jiang, Yu-Feng Li, Kewei Tu, Pengjun Xie, Fei Huang
| Challenge: | Existing approaches to enabling LLM web search proficiency struggle with data production in open-search domains, while supervised fine-tuning struggles with data utilization efficiency. |
| Approach: | They propose an iterative self-evolution framework that combines SFT and RL to enhance agentic web search capabilities without external human-annotated reasoning data. |
| Outcome: | EvolveSearch achieves 4.7% improvement over current state-of-the-art in seven benchmarks . supervised fine-tuning struggles with data production in open-search domains compared with RL . |
AutoEvolve: Automatically Evolving Queries for Applicable and Scalable Retrieval-Augmented Generation Benchmarking (2025.findings-emnlp)
Copied to clipboard
Ding-Chu Zhang, Xiaowen Zhang, Yue Fei, Renjun Hu, Xiao-Wen Yang, Zhi Zhou, Baixuan Li, Yu-Feng Li, Xing Shi, Wei Lin
| Challenge: | Existing automated generation methods exhibit Weak Applicability and Weak Scalability . existing methods are limited by their reliance on metadata from specific corpora . |
| Approach: | They propose an approach to generate scalable RAG benchmarks using corpus-agnostic methods . they propose a difficulty-guided metric that directs query evolution process . |
| Outcome: | The proposed approach evolves queries significantly more challenging than existing methods . it is able to dynamically increase difficulty, limiting scalability of the query . |
VCSearch: Bridging the Gap Between Well-Defined and Ill-Defined Problems in Mathematical Reasoning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies have improved the performance of Large language models on well-defined mathematical benchmarks, but they often overlook ill-defined problems. |
| Approach: | They develop a large-scale benchmark that contains over 5,000 ill-defined mathematical problems. |
| Outcome: | The proposed framework improves the accuracy of identifying unsolvable problems by at least 12% across different LLMs, thus achieving stronger robust mathematical reasoning ability. |