One Goal, Many Challenges: Robust Preference Optimization Amid Content-Aware and Multi-Source Noise

Amirabbas Afzali, Amirhossein Afsharrad, Seyed Shahabeddin Mousavi, Sanjay Lall
3/16/2025
cs.LGcs.CL

No confident code implementation found for this paper. 6 possible matches can be shown below.

Abstract

Large Language Models (LLMs) have made significant strides in generating human-like responses, largely due to preference alignment techniques. However, these methods often assume unbiased human feedback, which is rarely the case in real-world scenarios. This paper introduces Content-Aware Noise-Resilient Preference Optimization (CNRPO), a novel framework that addresses multiple sources of content-dependent noise in preference learning. CNRPO employs a multi-objective optimization approach to separate true preferences from content-aware noises, effectively mitigating their impact. We leverage backdoor attack mechanisms to efficiently learn and control various noise sources within a single model. Theoretical analysis and extensive experiments on different synthetic noisy datasets demonstrate that CNRPO significantly improves alignment with primary human preferences while controlling for secondary noises and biases, such as response length and harmfulness.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 6 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{afzali2025goal,
  title  = {One Goal, Many Challenges: Robust Preference Optimization Amid Content-Aware and Multi-Source Noise},
  author = {Amirabbas Afzali and Amirhossein Afsharrad and Seyed Shahabeddin Mousavi and Sanjay Lall},
  year   = {2025},
  eprint = {2503.12301},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.12301v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.12301.svg)](https://codeofpaper.com/paper/2503.12301)

Discussion