Papers by Yuyao Zhang
FinSight: Towards Real-World Financial Deep Research (2026.acl-long)
Copied to clipboard
| Challenge: | FinSight is the first multi-agent framework for automating end-to-end professional, multimodal financial reports. |
| Approach: | They propose a code agent with variable memory architecture that unifies data, tools, and agents into a programmable variable space. |
| Outcome: | The proposed framework outperforms leading deep research systems in factual accuracy, analytical depth, and presentation quality. |
A Survey of RAG-Reasoning Systems in Large Language Models (2025.findings-emnlp)
Copied to clipboard
Yangning Li, Weizhi Zhang, Yuyao Yang, Wei-Chieh Huang, Yaozu Wu, Junyu Luo, Yuanchen Bei, Henry Peng Zou, Xiao Luo, Yusheng Zhao, Chunkit Chan, Yankai Chen, Zhongfen Deng, Yinghui Li, Hai-Tao Zheng, Dongyuan Li, Renhe Jiang, Ming Zhang, Yangqiu Song, Philip S. Yu
| Challenge: | a survey of RAG-based reasoning-based approaches shows that it is not effective for multi-step inferences. |
| Approach: | They map how advanced reasoning optimizes each stage of RAG . they show how retrieved knowledge supply missing premises and expand context for complex inference . |
| Outcome: | The proposed frameworks achieve state-of-the-art across knowledge-intensive benchmarks. |
Hierarchical Document Refinement for Long-context Retrieval-augmented Generation (2025.acl-long)
Copied to clipboard
Jiajie Jin, Xiaoxi Li, Guanting Dong, Yuyao Zhang, Yutao Zhu, Yongkang Wu, Zhonghua Li, Ye Qi, Zhicheng Dou
| Challenge: | Real-world RAG applications often encounter long-context input scenarios where redundant information and noise results in higher inference costs and reduced performance. |
| Approach: | They propose an efficient plug-and-play refiner that leverages the structural characteristics of long documents. |
| Outcome: | Experiments on seven QA datasets show that LongRefiner achieves competitive performance in various scenarios while using 10x fewer computational costs and latency compared to baseline. |
Search-o1: Agentic Search-Enhanced Large Reasoning Models (2025.emnlp-main)
Copied to clipboard
Xiaoxi Li, Guanting Dong, Jiajie Jin, Yuyao Zhang, Yujia Zhou, Yutao Zhu, Peitian Zhang, Zhicheng Dou
| Challenge: | Large reasoning models (LRMs) have demonstrated impressive long stepwise reasoning capabilities through large-scale reinforcement learning. |
| Approach: | They propose a framework that enhances large reasoning models with an agentic retrieval-augmented generation mechanism and a Reason-in-Documents module for refining retrieved documents. |
| Outcome: | The proposed framework enhances LRMs with an agentic retrieval-augmented generation mechanism and Reason-in-Documents module for refining retrieved documents. |
PD3F: A Pluggable and Dynamic DoS-Defense Framework against resource consumption attacks targeting Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing work lacks mitigation strategies against resource consumption attacks . existing work does not provide mitigation strategies for real-world LLM deployments . |
| Approach: | They propose a pluggable and dynamic doS-Defense framework which employs a two-stage approach to defend against resource consumption attacks from both the input and output sides. |
| Outcome: | The proposed framework significantly mitigates resource consumption attacks, improving users’ access capacity by up to 500% during adversarial load. |
Web Sitemap Knowledge Can Enhance Autonomous Browsing (2026.findings-acl)
Copied to clipboard
Yuyao Zhang, Hongyu Lu, Jiajie Jin, Hongjin Qian, Shiyu Li, Zhao Yang, Yutao Zhu, Ji-Rong Wen, Zhicheng Dou
| Challenge: | Existing web agents suffer from limited robustness, efficiency and task success due to lack of structural understanding of websites and lack of browsing priors in pre-trained models. |
| Approach: | They propose an agent-oriented sitemap protocol that integrates structured website knowledge into web agents. |
| Outcome: | The proposed agent-oriented sitemap improves robustness, efficiency and effectiveness without extra training. |
Thinking-Based Non-Thinking: Solving the Reward Hacking Problem in Training Hybrid Reasoning Models via Reinforcement Learning (2026.acl-long)
Copied to clipboard
Siyuan Gan, Jiaheng Liu, Boyan Wang, Tianpei Yang, Runqing Miao, Yuyao Zhang, Fanyu Meng, Junlan Feng, Linjian Meng, Jing Huo, Yang Gao
| Challenge: | Existing work on large reasoning models (LRMs) focuses on using reinforcement learning (RL) to train hybrid reasoning models that automatically decide whether to engage in thinking or not based on the complexity of the query. |
| Approach: | They propose to use reinforcement learning to train hybrid reasoning models that automatically decide whether to engage in thinking or not based on the complexity of the query. |
| Outcome: | The proposed model reduces token usage by around 50%$ compared to DeepSeek-R1-Distill-Qwen-1.5B/7B and DeepScaleR-1.5b, while significantly improving accuracy. |
Enabling Discriminative Reasoning in LLMs for Legal Judgment Prediction (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing large language models (LLMs) underperform in legal judgment prediction due to challenges in understanding case facts and distinguishing between similar charges. |
| Approach: | They propose a framework that allows LLMs to discriminate among charges and a judicial reasoning framework to improve their models for effective legal judgment prediction. |
| Outcome: | The proposed framework improves accuracy and efficiency when dealing with complex and confusing charges. |
Neuro-Symbolic Query Compiler (2025.findings-acl)
Copied to clipboard
| Challenge: | Retrieval-Augmented Generation (RAG) systems are limited in their ability to process information in open-source environments. |
| Approach: | They propose a neuro-symbolic framework inspired by linguistic grammar rules and compiler design to formalize complex queries using a minimal yet sufficient Backus-Naur Form grammar. |
| Outcome: | The proposed framework is based on a backus-naur form grammar and compiler design that maintains completeness while minimizing redundancy. |