arXiv (All)
open access
SPD: Single Pass Decoding for Generative Reranking
Large language models (LLMs) achieve state-of-the-art generative ranking quality, but the ranking they produce must be decoded, and autoregressive decoding spends one sequential forward pass per emitted token. We observe that the only tokens a ranker must emit are the $N$ ordinal values naming the i
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
- Quit While You're Ahead: Quit for Efficient Candidate Generation in Machine Translation Reranking#998368
- Consensus Group Relative Policy Optimization for Text Generation#927222
- LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusion#16623
- Retrieval-augmented Decoding for Improving Truthfulness in Open-ended Generation#972942
- ROSETTA: Efficient and Accurate Privacy-Preserving LLM Decoding via Hybrid CKKS/TFHE Evaluation#1123327
Record · ID 971887
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