arXiv Artificial Intelligence

When Reranking Hurts: Uncertainty-Based Gating for Few-Shot Reranking

1 day ago 12.08.2026 07:00 👁 3 views
When Reranking Hurts: Uncertainty-Based Gating for Few-Shot Reranking

Quick summary

arXiv:2606.31087v3 Announce Type: replace-cross Abstract: Few-shot selection typically assumes that reranking retrieved examples always improves performance. We challenge this view by identifying that the expensive reranking step can in fact degrade performance. Instead, we propose \emph{Training-Free Gated Reranking}, which decides whether to rerank the few-shot examples based on the model's uncertainty. Extensive experiments across 8 LLMs, covering 7 NLU datasets and 18 MT domain-direction combinations, demonstrate that our approach reduces average computational costs by approximately 20\% f

Key takeaways

  • arXiv:2606.31087v3 Announce Type: replace-cross Abstract: Few-shot selection typically assumes that reranking retrieved examples always improves performance.
  • We challenge this view by identifying that the expensive reranking step can in fact degrade performance.
  • Instead, we propose \emph{Training-Free Gated Reranking}, which decides whether to rerank the few-shot examples based on the model's uncertainty.

Why it matters

This model development creates a new option for users and a new testing obligation for developers. A fixed evaluation set comparing quality, cost and failure behavior is more useful than launch claims.

Kaynak sitede devamını oku: arXiv Artificial Intelligence ↗