Yubo Zhu
Author directory2026
KFS-RAG: Mitigating Database Leakage in RAG Systems with Keyword-Grounded Fact Substitution
ZiLiang Zhang | Yubo Zhu | Wei Tong | Jingyu Hua | Zijian Wang | Yuan Zhang | Sheng Zhong
Findings of the Association for Computational Linguistics: EMNLP 2026
ZiLiang Zhang | Yubo Zhu | Wei Tong | Jingyu Hua | Zijian Wang | Yuan Zhang | Sheng Zhong
Findings of the Association for Computational Linguistics: EMNLP 2026
Retrieval-Augmented Generation (RAG) has emerged as a powerful paradigm for combining large language models (LLMs) with external knowledge sources. However, RAG systems remain vulnerable to prompt injection attacks, which may mislead the retriever or generator to expose sensitive database contents. To address this issue, we propose KFS-RAG, a defense that mitigates information leakage by reformulating the retrieved context. Specifically, our method first identifies a small set of influential keywords from the retrieved context via an attention rollout plus a causal perturbation mechanism. These keywords are then used to guide an auxiliary LLM to generate a compact set of keyword-grounded facts from the retrieved passages. Finally, the original context is substituted with these curated facts, ensuring that the generator operates on sanitized evidence rather than the raw retrieved text. Experimental evaluations demonstrate that KFS-RAG significantly reduces the risk of database leakage under injection attacks while maintaining response accuracy and relevance. This work highlights a practical pathway toward building secure and trustworthy RAG systems.
When Does Visual Generation Help Visual Understanding in Unified Multimodal Models?
Yubo Zhu | Zhehan Kan | Jingyi Yang | Miaolin Chen | Jinbo Xing | Kai Zhu | Zijian Wang | Sheng Zhong | Wei Tong
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yubo Zhu | Zhehan Kan | Jingyi Yang | Miaolin Chen | Jinbo Xing | Kai Zhu | Zijian Wang | Sheng Zhong | Wei Tong
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Unified multimodal models (UMMs) can perform both understanding and generation, raising a central question: can visual generation improve understanding? Existing evaluations provide mixed evidence, but confound task difficulty, reasoning paradigms, and the closed-loop interaction between generation and understanding. We introduce a fine-grained evaluation framework for vision generation-assisted understanding. It stratifies samples by difficulty, enables unified evaluation of multiple reasoning paradigms, and uses Oracle-Assisted Reference Protocols to decouple generation from understanding. Our analysis shows that generated visual aids help on easier instances but become unreliable as reasoning complexity increases. Oracle-assisted diagnosis further reveals that the main bottleneck often lies in visual understanding rather than generation, as current UMMs struggle to leverage even faithful visual aids. We also show that effective visual generation should target visual-understanding bottlenecks rather than add more reasoning steps, and identify a three-stage transition from task-irrelevant noise, to misleading plausible guidance, and finally to useful assistance. These findings lay a reliable foundation for the next stage of UMM development. The code is available at https://github.com/zyb1029/VGAU-Diag.
2025
The LLM Already Knows: Estimating LLM-Perceived Question Difficulty via Hidden Representations
Yubo Zhu | Dongrui Liu | Zecheng Lin | Wei Tong | Sheng Zhong | Jing Shao
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Yubo Zhu | Dongrui Liu | Zecheng Lin | Wei Tong | Sheng Zhong | Jing Shao
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Estimating the difficulty of input questions as perceived by large language models (LLMs) is essential for accurate performance evaluation and adaptive inference. Existing methods typically rely on repeated response sampling, auxiliary models, or fine-tuning the target model itself, which may incur substantial computational costs or compromise generality. In this paper, we propose a novel approach for difficulty estimation that leverages only the hidden representations produced by the target LLM. We model the token-level generation process as a Markov chain and define a value function to estimate the expected output quality given any hidden state. This allows for efficient and accurate difficulty estimation based solely on the initial hidden state, without generating any output tokens. Extensive experiments across both textual and multimodal tasks demonstrate that our method consistently outperforms existing baselines in difficulty estimation. Moreover, we apply our difficulty estimates to guide adaptive reasoning strategies, including Self-Consistency, Best-of-N, and Self-Refine, achieving higher inference efficiency with fewer generated tokens.