CLJan 25

PEAR: Pairwise Evaluation for Automatic Relative Scoring in Machine Translation

arXiv:2601.18006v1
Originality Incremental advance
AI Analysis

This addresses the challenge of efficient and accurate quality estimation in machine translation for researchers and practitioners, representing an incremental improvement over existing methods.

The paper tackles the problem of reference-free machine translation evaluation by introducing PEAR, a pairwise evaluation metric that predicts quality differences between candidate translations, which outperforms single-candidate baselines on the WMT24 benchmark and reduces scoring costs for decoding.

We present PEAR (Pairwise Evaluation for Automatic Relative Scoring), a supervised Quality Estimation (QE) metric family that reframes reference-free Machine Translation (MT) evaluation as a graded pairwise comparison. Given a source segment and two candidate translations, PEAR predicts the direction and magnitude of their quality difference. The metrics are trained using pairwise supervision derived from differences in human judgments, with an additional regularization term that encourages sign inversion under candidate order reversal. On the WMT24 meta-evaluation benchmark, PEAR outperforms strictly matched single-candidate QE baselines trained with the same data and backbones, isolating the benefit of the proposed pairwise formulation. Despite using substantially fewer parameters than recent large metrics, PEAR surpasses far larger QE models and reference-based metrics. Our analysis further indicates that PEAR yields a less redundant evaluation signal relative to other top metrics. Finally, we show that PEAR is an effective utility function for Minimum Bayes Risk (MBR) decoding, reducing pairwise scoring cost at negligible impact.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes