๐ค AI Summary
ไธบ่งฃๅณๆๅฐ่ดๅถๆฏ้ฃ้ฉ่งฃ็ ไธญ็ๅบฆ้่ฟๆๅ้ฎ้ข๏ผๆฌๆ้่ฟๅฅๅผๅผๅ่งฃๆณๅฏนๆ็จ็ฉ้ต่ฟ่ก้ๅชๅค็๏ผไป่ๆ้ซๆๆฌ็ๆ่ดจ้ใ
๐ 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.