arXiv (All)
open access
Document Optimization for Black-Box Retrieval via Reinforcement Learning
Generative large language models (LLMs) are increasingly used as inference-time components in retrieval pipelines, for tasks such as query rewriting and document reranking. However, these online approaches place costly autoregressive computation directly on the latency-critical retrieval path. We ex
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- AdaTutoRank: Learning to Rerank Document Sets via Adaptive Tutoring Optimization for RAG and Deep Research#1116803
- Retrieval-in-the-Chain: Bootstrapping Large Language Models for Generative Retrieval#1048303
- The Ability of Generative Artificial Intelligence to Evaluate the Quality of Scholarly Output#1360410
- Large Language Model Turnover Undermines Screening for Artificial Intelligence-Assisted Scientific Writing#1248879
- Do Large Language Models Favor Recent Content? A Study on Recency Bias in LLM-Based Reranking#1050764
Record · ID 1232703
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive