hLLM: Single Pass Decoding for Generative Reranking
This story is from 2026-09-03. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2609.01807v1 Announce Type: new Abstract: 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…
Read the full story at arXiv cs.LG ↗
Timeline · 1 report
- 2026-09-03 04:00 · arXiv cs.LG
hLLM: Single Pass Decoding for Generative Reranking