[KongchangAI]
PaperCleanRM

CleanRM

A paper on training reward models by calibrating noisy labels with clean preference data. It aims to obtain quality approaching that of clean annotation from inexpensive and noisy labels.

Timeline (last 90 days)

Oct 16

Training a reward model directly on noisy preference data yields biased risk estimates.

Unverified50%
Oct 16

The core method of CleanRM is to calibrate the noise ratio on a per-sample basis rather than estimating a global noise rate.

Unverified50%
Oct 16

CleanRM uses Optimal Transport to align the noisy preference distribution with a small clean feedback distribution.

Unverified50%
Oct 16

CleanRM constructs a corrected surrogate loss function to train the reward model, and theoretically proves that this objective function is unbiased with respect to the clean risk.

Unverified50%
Oct 16

The entire CleanRM pipeline requires only a small amount of clean feedback to denoise the whole preference dataset.

Unverified50%
Oct 16

CleanRM surpasses current state-of-the-art baseline methods on denoising metrics.

Unverified50%
Oct 16

CleanRM demonstrates more effective alignment results in the more critical downstream RLHF alignment task.

Unverified50%
Oct 16

The transport plan matrix of optimal transport provides per-sample-level structural information, which is the key technical prerequisite for achieving per-sample calibration rather than global uniform denoising.

Unverified50%
Oct 16

The computational overhead of optimal transport, the sampling strategy for clean feedback, and the stability of noise ratio estimation under extremely sparse clean data are issues that need to be weighed in deployment.

Unverified50%

All Facts (9)

Source Articles