arXiv:2606. 28343v1 Announce Type: cross Abstract: Retrieval-augmented generative agents rely on retrieval for grounding, yet are typically evaluated on a query-by-query basis.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
The paper introduces DEPT, a method that trains a single decoder-only large language model to both expand queries and encode documents for retrieval. By preserving document embeddings close to their initial cached values while allowing gradients to flow through the generator, DEPT stabilizes retrieval targets and enables efficient index reuse and online hard‑negative mining. Experiments on the BEIR benchmark with Qwen3‑4B‑Instruct‑2507 and LLaMA‑3.2‑3B‑Instruct show that DEPT outperforms training‑free, independently trained, and staged unified baselines, with ablations confirming the benefits of preservation, whitening, end‑to‑end expansion training, and online negatives.
The paper introduces Librarian Agents, a framework that trains large language models to proactively curate long-context workspaces by reorganizing raw documents into a hierarchical filesystem of synthetic files and reference links. This builder agent, optimized via reinforcement learning, aims to maximize downstream answering accuracy by anticipating future queries rather than reacting to them. Experiments show that Librarian Agents outperform leading retrieval and precomputation methods, achieving a 33‑point accuracy gain on BrowseComp‑Plus and a 31‑point improvement on BRIGHT in zero‑shot settings.
Language models often produce semantically similar answers to open-ended questions, even when many plausible alternatives exist. Generating useful alternatives requires identifying both what the query...
arXiv:2604.05087v4 Announce Type: replace Abstract: Generative large language models (LLMs) are increasingly used as inference-time components in retrieval pipelines, for tasks such as query rewritin...
The paper introduces a retrieval‑grounded credit‑assignment method for generative recommenders that use Semantic IDs (SIDs). By structuring each autoregressive trace into a history summary, a set of interest hypotheses, and a final SID, a frozen retriever verifies each hypothesis as a catalog query. Rewards are assigned at the hypothesis level when any query retrieves the target within the top‑K, allowing distinct updates for rollouts that share the same SID reward and improving SID recommendation performance on Amazon Reviews datasets.
arXiv:2610.20162v1 Announce Type: cross Abstract: Language models often produce semantically similar answers to open-ended questions, even when many plausible alternatives exist. Generating useful al...