SAGE: Strategy-Adaptive Generation Engine for Query Rewriting
Not on the map. Why?
Abstract (arXiv)
Query rewriting is pivotal for enhancing dense retrieval, yet current methods demand large-scale supervised data or suffer from inefficient reinforcement learning (RL) exploration. In this work, we first establish that guiding Large Language Models (LLMs) with a concise set of expert-crafted strategies, such as semantic expansion and entity disambiguation, substantially improves retrieval effectiveness on challenging benchmarks, including HotpotQA, FEVER, NFCorpus, and SciFact. Building on this insight, we introduce the Strategy-Adaptive Generation Engine (SAGE), which operationalizes these strategies in an RL framework. SAGE introduces two novel reward shaping mechanisms-Strategic Credit Shaping (SCS) and Contrastive Reward Shaping (CRS)-to deliver more informative learning signals. This strategy-guided approach not only achieves new state-of-the-art NDCG@10 results, but also uncovers a compelling emergent behavior: the agent learns to select optimal strategies, reduces unnecessary exploration, and generates concise rewrites, lowering inference cost without sacrificing performance. Our findings demonstrate that strategy-guided RL, enhanced with nuanced reward shaping, offers a scalable, efficient, and more interpretable paradigm for developing the next generation of robust information retrieval systems.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 25 of its 42 references that are in the map. First posted on arXiv 24 Jun 2025.
Builds on
25 of 42 references.
References · 25
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2023GPT-4 Technical Reportcited by 18,396
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2025Qwen3 Technical Reportcited by 8,820
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,893
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,754
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
13 more
- 2024HybridFlow: A Flexible and Efficient RLHF Frameworkcited by 2,057
- 2018FEVER: a large-scale dataset for Fact Extraction and VERificationcited by 1,375
- 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,216
- 2023Large Language Models are not Fair Evaluatorscited by 1,085
- 2020Fact or Fiction: Verifying Scientific Claimscited by 554
- 2025VAPO: Efficient and Reliable Reinforcement Learning for Advanced Reasoning Taskscited by 285
- 2024Language Models Learn to Mislead Humans via RLHFcited by 124
- 2025DeepRetrieval: Hacking Real Search Engines and Retrievers with Large Language Models via Reinforcement Learningcited by 66
- 2025Towards Hierarchical Multi-Step Reward Models for Enhanced Reasoning in Large Language Modelscited by 18
- 2024BPP-Search: Enhancing Tree of Thought Reasoning for Mathematical Modeling Problem Solvingcited by 15
- 2024Leveraging Large Language Models for Solving Rare MIP Challengescited by 10
- 2024Large Language Models are Good Multi-lingual Learners : When LLMs Meet Cross-lingual Promptscited by 10
- 2024MaFeRw: Query Rewriting with Multi-Aspect Feedbacks for Retrieval-Augmented Large Language Modelscited by 9
Built on by
Citing papers per year: 2025: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2025Annotation-Free Reinforcement Learning Query Rewriting via Verifiable Search Reward
- 2025DynamicRAG: Leveraging Outputs of Large Language Model as Feedback for Dynamic Reranking in Retrieval-Augmented Generation
- 2025Rethinking On-policy Optimization for Query Augmentation
- 2025ReZero: Enhancing LLM search ability by trying one-more-time
- 2025Think Before You Retrieve: Learning Test-Time Adaptive Search with Small Language Models
- 2023Query Rewriting for Retrieval-Augmented Large Language Models
- 2026When should I search more: Adaptive Complex Query Optimization with Reinforcement Learning
- 2026Understanding the Behaviors of Environment-aware Information Retrieval