Papers by Yongkang Jin
RetroLLM: Empowering Large Language Models to Retrieve Fine-grained Evidence within Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods rely on separate retrievers to fetch top-k text chunks for generating evidence, and they lack joint optimization. |
| Approach: | They propose a framework that integrates retrieval and generation into a single, auto-regressive process, enabling LLMs to directly generate fine-grained evidence from the corpus with constrained decoding. |
| Outcome: | Extensive experiments on five open-domain QA datasets demonstrate the proposed framework’s superior performance across both in-domain and out-of-domain tasks. |
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. |
HTMR: Hybrid Token Masking Reinforcement Learning with Verifiable Rewards for Event Argument Extraction with Multi-Perspective Reasoning (2026.acl-long)
Copied to clipboard
| Challenge: | Recent work formulates EAE with large language models as a structured conditional generation task and applies Reinforcement Learning with Verifiable Rewards (RLVR) to optimize sequence-level event structures. |
| Approach: | They propose a method that selectively updates policy gradients on high-entropy forking tokens and event-critical tokens that define event structure. |
| Outcome: | The proposed method outperforms full-token and high-entropy only methods and transfers effectively as a plug-and-play approach to other tasks such as named entity recognition and relation classification. |
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. |