Skip to content

Overfitting Mitigation via Singular Value Decomposition in Minimum Bayes Risk Decoding

Sep 2026 · 0 citations · 26 references
Computer Science

TL;DR

This work introduces SVD-MBR, which frames the pairwise utility matrix as a noisy information signal, and reveals 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.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Beyond Truncation: Rethinking LLM Decoding as Ensemble Pruning

This work introduces Mahalanobis-Ensemble Decoding (ME-Decoding), a novel Large Language Model (LLM) decoding framework that frames candidate token selection as ensemble pruning and devise an efficient greedy selection algorithm with near-linear complexity in the candidate size under early stopping, while establishing...

Dun-Yao Xue, Cheng-Shuo Du, Zheng-Bo Wang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Accuracy is Not Enough: A Divergence-Based Approach to Evaluate Fidelity Loss in Quantized LLMs

Deployment of Large Language Models (LLMs) on memory-constrained edge devices relies heavily on aggressive post-training quantization. However, evaluating these models is largely based on zero-shot task accuracy, which depends solely on argmax predictions and is insensitive to changes in the underlying predictive distr...

Shahzeb Qamar, L. Sparrenberg, Christian Bauckhage et al. · 1 citation
Preprint Aug 2026

QuaSAR: Quantization Compensation via Stable Activation-Aware Rank Truncation

This paper proposes a parameter-free truncated pseudoinverse solver which removes collapsed directions prior to inversion, and achieves 81.42\% top-1 accuracy, outperforming prior post-training methods and fine-tuning-based baselines.

Lin-Fa Lee, Yi-Yu Chang, Kuo-Hei Yeh · 0 citations
#machine learning Preprint Sep 2026

Understanding LLM Quantization through Activation-Guided Compensation and Orthogonal Residuals

Practical guidelines for applying randomized Hadamard rotation, sign selection, and channel scaling are derived, which explain how random signs suppress constructive interference among persistent outlier channels, how sampling multiple sign patterns can improve transformation selection, and how second-moment balancing...

Yamato Narita, Issei Sato · 0 citations
Preprint Aug 2026

Jacobian-guided Noise Injection for Quantization Robustness in Large Language Models

This work proposes Jacobian-Guided Noise Injection, a training strategy that injects zero-mean Gaussian noise into pre-attention logits, with variance derived directly from the Jacobian Frobenius norm, which provides a way to identify the optimal noise variance based on the local attention sensitivity.

D. Pandey, Arnav Chavan, Nahush Lele et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.