analiza aiqbench
This research addresses a critical stability issue in Large Language Model evaluation by applying Singular Value Decomposition to filter metric noise during Minimum Bayes Risk decoding. By isolating the low-rank consensus signal, the proposed SVD-MBR method prevents overfitting to specific utility metrics while improving generalization across diverse evaluation standards. The study highlights that neural-based metrics are particularly well-suited for this denoising approach, offering a robust pathway for more reliable model assessment.
Overfitting Mitigation via Singular Value Decomposition in Minimum Bayes Risk Decoding
arXiv:2609.01135v1 Announce Type: new Abstract: Minimum Bayes Risk (MBR) decoding enables high-quality text generation by selecting the hypothesis that maximizes a utility metric over sampled pseudo-references. However, it is highly susceptible to metric overfitting: it can irregularly inflate the chosen utility metric at the direct expense of other unoptimized evaluation metrics. To mitigate this, we introduce SVD-MBR, which frames the pairwise utility matrix as a noisy information signal. By computing a low-rank approximation via Singular Value Decomposition (SVD) and retaining only the top-$k$ components, we effectively decouple true consensus from metric noise. Experiments demonstrate that SVD-MBR successfully regularizes decoding, yielding substantial gains across a range of generalized metrics. Furthermore, we reveal that this denoising is metric-dependent: neural metrics encode a robust low-rank consensus ideal for SVD, whereas surface-level metrics struggle to separate signal from metric noise.
Abstract:Minimum Bayes Risk (MBR) decoding enables high-quality text generation by selecting the hypothesis that maximizes a utility metric over sampled pseudo-references. However, it is highly susceptible to metric overfitting: it can irregularly inflate the chosen utility metric at the direct expense of other unoptimized evaluation metrics. To mitigate this, we introduce SVD-MBR, which frames the pairwise utility matrix as a noisy information signal. By computing a low-rank approximation via Singular Value Decomposition (SVD) and retaining only the top-$k$ components, we effectively decouple true consensus from metric noise. Experiments demonstrate that SVD-MBR successfully regularizes decoding, yielding substantial gains across a range of generalized metrics. Furthermore, we reveal that this denoising is metric-dependent: neural metrics encode a robust low-rank consensus ideal for SVD, whereas surface-level metrics struggle to separate signal from metric noise.
Computation and Language (cs.CL)
arXiv:2609.01135 [cs.CL]
(or arXiv:2609.01135v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2609.01135 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 226 cuvinte
Subiecte conexe

Deconfusing Corrigibility
AI Alignment Forum · 17 oct. 2026
The J-Space Debate, Agent Swarms, and Pacing Frontier AI - Digital Minds Newsletter #4
LessWrong · 18 sept. 2026

How to apply to AI safety fellowships (and beyond)
LessWrong · 2 oct. 2026

Reviewing failure modes in science as we prepare for AI researchers
LessWrong · 8 oct. 2026