SPD: Single Pass Decoding for Generative Reranking
cs.LG, cs.AI, cs.IR
Submitted: 2026-09-01
Updated: 2026-09-04
Comments: 10 pages
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Medusa: Simple LLM Inference Acceleration Framework with Multiple Decoding Heads
- LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding
- Distilling the Knowledge in a Neural Network
- Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation
- LoRA: Low-Rank Adaptation of Large Language Models
- EAGLE: Speculative Sampling Requires Rethinking Feature Uncertainty
- DiffuRank: Effective Document Reranking with Diffusion Language Models
- RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!
- Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents
- NGA: Non-autoregressive Generative Auction with Global Externalities for Advertising Systems
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks