Saved in:
| Main Authors: | , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.15514 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911712005849088 |
|---|---|
| author | Liu, Boyin Zhang, Zhuo Huang, Sen Xie, Lipeng Fu, Qingxu Chen, Haoran YU, LI Hu, Tianyi Liu, Zhaoyang Ding, Bolin Zhao, Dongbin |
| author_facet | Liu, Boyin Zhang, Zhuo Huang, Sen Xie, Lipeng Fu, Qingxu Chen, Haoran YU, LI Hu, Tianyi Liu, Zhaoyang Ding, Bolin Zhao, Dongbin |
| contents | Reinforcement Learning from AI Feedback (RLAIF) relies on LLM judges as preference measurement instruments, yet these instruments are fundamentally limited by random measurement errors -- stochastic fluctuations that manifest as preference cycles (e.g., $A \succ B \succ C \succ A$), occurring in 5-9% of evaluations across state-of-the-art models. While repeated sampling mitigates noise by averaging multiple judgments, it treats each comparison in isolation and fails to exploit the structural constraints that distinguish systematic signals from random noise. We introduce Topological Consensus Rewards (TCR), a framework that leverages transitivity as a denoising mechanism via topological majority voting: systematic signals reinforce each other through transitive chains, while random errors cluster into topologically exposed cycles. TCR approximates the Maximum Acyclic Subgraph to filter stochastic noise from preference signals. We also propose Cycle Incidence Rate (CIR) as a diagnostic metric that measures the proportion of samples containing preference cycles. Under our noise model, these cycles arise primarily from stochastic measurement errors rather than genuine intransitivity. Experiments on Arena-Hard, MT-Bench, and WritingBench demonstrate that TCR consistently outperforms pairwise baselines and classical ranking algorithms, while exhibiting robust performance across different judge models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_15514 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Voting with the Graph: Stable RLAIF via Topological Consistency Maximization Liu, Boyin Zhang, Zhuo Huang, Sen Xie, Lipeng Fu, Qingxu Chen, Haoran YU, LI Hu, Tianyi Liu, Zhaoyang Ding, Bolin Zhao, Dongbin Artificial Intelligence Reinforcement Learning from AI Feedback (RLAIF) relies on LLM judges as preference measurement instruments, yet these instruments are fundamentally limited by random measurement errors -- stochastic fluctuations that manifest as preference cycles (e.g., $A \succ B \succ C \succ A$), occurring in 5-9% of evaluations across state-of-the-art models. While repeated sampling mitigates noise by averaging multiple judgments, it treats each comparison in isolation and fails to exploit the structural constraints that distinguish systematic signals from random noise. We introduce Topological Consensus Rewards (TCR), a framework that leverages transitivity as a denoising mechanism via topological majority voting: systematic signals reinforce each other through transitive chains, while random errors cluster into topologically exposed cycles. TCR approximates the Maximum Acyclic Subgraph to filter stochastic noise from preference signals. We also propose Cycle Incidence Rate (CIR) as a diagnostic metric that measures the proportion of samples containing preference cycles. Under our noise model, these cycles arise primarily from stochastic measurement errors rather than genuine intransitivity. Experiments on Arena-Hard, MT-Bench, and WritingBench demonstrate that TCR consistently outperforms pairwise baselines and classical ranking algorithms, while exhibiting robust performance across different judge models. |
| title | Voting with the Graph: Stable RLAIF via Topological Consistency Maximization |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2510.15514 |