SRAS: A Lightweight Reinforcement Learning-based Document Selector for Edge-Native RAG Pipelines
On the map: Retrieval-augmented generation → Agentic RAG, agents and memory
Abstract (arXiv)
Retrieval-Augmented Generation (RAG) systems often rely on fixed top-k document selection mechanisms that ignore downstream generation quality and impose computational overheads. We propose SRAS (Sparse Reward-Aware Selector), a lightweight document selector trained via reinforcement learning (RL) for edge-native RAG deployment. Unlike prior RL-based retrievers that assume large memory and latency budgets, SRAS learns a compact (~0.76MB) policy using Proximal Policy Optimization (PPO), guided by a hybrid reward signal combining Relaxed F1 and BERTScore. Our method operates under tight token and compute constraints, maintaining <1s latency on CPU. SRAS outperforms supervised and random selectors on a synthetic QA benchmark, and generalizes to real-world data, achieving BERTScore F1 of 0.8546 on SQuAD v2 without domain-specific tuning. This work is the first to demonstrate that RL-based document selection can be made ultra-lightweight, latency-aware, and effective for on-device RAG pipelines.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Agentic RAG, agents and memory, one of 15 directions in Retrieval-augmented generation. Builds on 11 of its 18 references that are in the map. First posted on arXiv 5 Jan 2026.
Builds on
11 of 18 references.
References · 11
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,297
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,512
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2020Leveraging Passage Retrieval with Generative Models for Open Domain Question Answeringcited by 1,210
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
- 2019Passage Re-ranking with BERTcited by 645
- 2017Efficient Processing of Deep Neural Networks: A Tutorial and Surveycited by 434
- 2018Learning a Deep Listwise Context Model for Ranking Refinementcited by 62
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Optimizing Retrieval for RAG via Reinforcement Learning
- 2025Query Decomposition for RAG: Balancing Exploration-Exploitation
- 2026DocPO: Advancing Document Policy Optimization via Tailored Step-Aware Rewards
- 2025Domain-Aware RAG: MoL-Enhanced RL for Efficient Training and Scalable Retrieval
- 2026Reinforcement Fine-Tuning for History-Aware Dense Retriever in RAG
- 2025Curriculum Guided Reinforcement Learning for Efficient Multi Hop Retrieval Augmented Generation
- 2024MBA-RAG: a Bandit Approach for Adaptive Retrieval-Augmented Generation through Question Complexity
- 2026Rethinking Soft Compression in Retrieval-Augmented Generation: A Query-Conditioned Selector Perspective