Skip to content

RAGnRoll: Learning to Iteratively Retrieve and Generate Attributable Answer Snippets

Jul 2026 · ACM Transactions on Information Systems · 0 citations · 95 references

TL;DR

This work proposes RAGnRoll, a language model for attributed answer generation within a multi-round Retrieval-Augmented Generation (RAG) framework that leverages the iterative nature of multi-round RAG to train an LLM to incrementally build answers guided by subqueries.

Abstract

The rapid adoption of generative search engines has marked a significant shift in information retrieval. New approaches leverage Large Language Models (LLMs) to provide synthesized, contextually rich responses in natural language to directly satisfy users’ information needs. Due to their generative nature, these systems benefit from enhanced reliability by integrating explicit references to supporting sources in their outputs, otherwise known as Attribution. Teaching LLMs this capability is a challenging task that heavily depends on training data quality and strong training signals, especially for scenarios that require digesting long contexts and providing comprehensive answers. Planning and decomposition have notoriously helped language models produce better answers, but their impact on attribution remains relatively unexplored. This work proposes RAGnRoll, a language model for attributed answer generation within a multi-round Retrieval-Augmented Generation (RAG) framework. We leverage the iterative nature of multi-round RAG to train an LLM to incrementally build answers guided by subqueries. RAGnRoll is trained using a causal language modeling objective and a small, specially crafted dataset. Empirical evaluations on four different datasets for attributed long answer generation (ASQA, ELI5) and information-seeking (HAGRID and CORAL) demonstrate RAGnRoll's impact on both answer correctness and attribution accuracy. We extensively evaluate RAGnRoll training approach against baseline methods and benchmark its performance at inference against strong state-of-the-art models. RAGnRoll achieves competitive performance with advanced approaches without relying on extensive data or complex training.

View source

Similar papers

Preprint Aug 2026

Search-GRT: Guided Retrieval Training of Search Agents to Optimize for Complex Question Answering

The effective use of search engines by large language models (LLMs) remains a significant challenge, particularly in complex, multi-hop question-answering (MHQA) tasks. These tasks require the model to decompose questions into subqueries, retrieve relevant information, and synthesize answers from multiple sources, often leading to cascading errors due to poor retrieval in early stages. Reinforcement learning (RL) has shown promise in improving LLMs'search capabilities, but it often suffers from sparse rewards during training, hindering the model's ability to learn effectively. To address these challenges, we introduce Guided Retrieval Training (GRT), a novel method that improves the performance of a search agent by restricting the retrieval process during RL training using ground truth information. By focusing on a curated set of relevant documents, GRT provides the model with a stronger learning signal, mitigating the problem of sparse rewards and improving its ability to generate accurate subqueries and synthesize correct answers. Our experimental results demonstrate that GRT achieves consistent performance improvements over existing methods, such as Search-R1, across a wide range of question-answering (QA) tasks. Notably, GRT excels in MHQA tasks, achieving over 40% improvements in performance. Additionally, GRT enhances training efficiency by achieving better QA performance with fewer training steps.

Aounon Kumar, Sudipta Paul, Vivek Kulkarni et al. · 0 citations
Review Open access Jul 2026

Retrieval-Augmented Generation for Trustworthy Enterprise LLM Assistants

Large language models (LLMs) have changed enterprise knowledge work. Their value, however, is capped by three failures: they hallucinate, their parametric memory is frozen and grows stale, and they cannot read the proprietary data that holds most business answers. Retrieval-Augmented Generation (RAG) targets all three. It grounds generation in passages fetched at inference time from an external, continuously updatable corpus, so answers become verifiable and citation-backed without any model retraining. This paper presents a technical synthesis of RAG for trustworthy enterprise assistants. The end-to-end pipeline is described in full: document chunking, embedding, vector indexing, retrieval, cross-encoder re-ranking, and grounded generation with inline citations. Advanced variants are then surveyed, namely hybrid sparse-dense retrieval, Hypothetical Document Embeddings (HyDE), graph-based RAG, and agentic iterative retrieval. A RAGAS-style evaluation method quantifies faithfulness, answer relevance, and context precision and recall. On an illustrative enterprise question-answering scenario, an advanced configuration that combines hybrid retrieval with cross-encoder re-ranking lifts faithfulness from 0.71 to 0.91 and context precision from 0.62 to 0.84 over naive dense-only RAG. Agentic retrieval reaches 0.95 faithfulness, but pays for it in latency. Enterprise concerns, including document-level access control, data security, cost, and latency budgets, are treated as first-class design constraints. The reported metrics are illustrative. They characterise representative trade-offs rather than a specific deployed study.

Bini P B · 0 citations
Book Open access Jul 2026

RedGR: Unified Generative Retrieval for Recommendation in REDnote

Recently, the generative retrieval paradigm has emerged as a transformative framework that significantly enhances the efficiency of large-scale industrial recommendation systems. This innovative approach systematically maps items to meaningful semantic identifiers (SIDs) and employs advanced sequence generation techniques to construct high-quality candidate sets, thereby enabling more accurate modeling of users' evolving interests and behavioral patterns. Nevertheless, two critical challenges remain inadequately addressed in current research: (1) Existing methodologies predominantly focus on modeling a single task such as predicting users' click behavior, while overlooking other tasks including predicting users' dwell-time and engagement behaviors, which are very important for video/content recommendation at the same time. The independent modeling of each task inevitably results in substantial computational overhead, thereby raising the pivotal question of whether the sophisticated multi-task learning capabilities inherent in LLMs can be effectively leveraged to achieve unified and efficient multi-task learning for generative retrieval. (2) The mapping mechanism from SIDs to concrete items requires substantial refinement to ensure precise and reliable retrieval performance. To tackle these issues, we propose RedGR, a generative retrieval model that unifies the modeling of multiple complex retrieval tasks. RedGR first applies the RQ-Kmeans algorithm to map items into SIDs, and then conducts pre-training on large-scale user behavior datasets to learn general knowledge. Then the RedGR model is finetuned on multi-task retrieval data with a unique instruction prompt for each task. This enables RedGR to generate the corresponding set of SIDs for each task. And the union of all sets of SIDs is the multi-task retrieval result. Finally, the Swing algorithm incorporates explicit, high-quality collaborative signals to strengthen the mapping from SIDs to specific items, thereby facilitating efficient retrieval of high-quality items. RedGR has been fully depolyed in the homefeed recommendation scenario of RedNote,serving hundreds of millions of users every day. Online A/B test results show a 0.178% increase in pagetime, a 0.734% increase in average user engagement, and a 0.076% growth in homefeed active users (FAU). These metrics collectively validate the superior performance of RedGR's unified retrieval modeling approach in complex multi-task scenarios.

Mengcheng Fang, Hongyu Wang, Xichuan Niu et al. · 0 citations
Open access Aug 2026

Integrating Retrieval-Augmented Generation with Large Language Model for Robust and Explainable AI Text Detection

Large Language Models (LLMs) have been rapidly evolving lately, resulting in the need for strong, explainable models to detect the difference between human-generated and machine-generated articles. Existing approaches which are mostly based on fine-tuned transformers suffer from several drawbacks such as rapid obsolescence, paraphrasing attacks, and lack of interpretability. To improve their ability to detect, this paper proposes a novel paradigm called Human vs. LLM Identification (HLI) which introduces a Retrieval-Augmented Generation (RAG)-inspired evidence-based detection strategy alongside a fine-tuned transformer classifier. Our core model, DeBERTa-Sentinel, is built on top of a fine-tuned Microsoft DeBERTa-v3-small model, which uses a disentangled attention mechanism to better capture subtle syntactic and stylistic deviations characteristic of AI-generated text. We evaluate our framework on a balanced dataset of 43,456 text samples, curated from the OpenGPTText corpus and covering AI-generated and human-authored content across diverse domains including news, education, and creative text. The experimental results show improved performance over the selected baselines, with our framework achieving an accuracy of 97.53%, precision of 95.89%, recall of 99.34%, and ROC-AUC of 99.53%. In addition, explainability is integrated into our framework through Local Interpretable Model-agnostic Explanations (LIME) analysis, providing token-level insight into classification decisions. This study establishes a benchmark for scalable, explainable AI text detection, with implications for academic integrity, content moderation, and combating misinformation.

Ibtasam Ur Rehman, Muhammad Islam, Muhammad Yousaf Rehman et al. · 0 citations
Preprint Jul 2026

Tool-Adaptive LLM Reranker

TALRanker is a novel framework that formalizes pointwise relevance scoring as an agentic Markov decision process that achieves state-of-the-art performance across standard and reasoning-intensive retrieval benchmarks, matching throughput with pointwise rerankers while outperforming parameter-heavy reasoning models.

Zichuan Liu, Ruijin Hua · 0 citations