Ranking-aware Reinforcement Learning for Ordinal Ranking

Aiming Hao, Chen Zhu, Jiashu Zhu, Jiahong Wu, Xiangxiang Chu
1/28/2026
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Ordinal regression and ranking are challenging due to inherent ordinal dependencies that conventional methods struggle to model. We propose Ranking-Aware Reinforcement Learning (RARL), a novel RL framework that explicitly learns these relationships. At its core, RARL features a unified objective that synergistically integrates regression and Learning-to-Rank (L2R), enabling mutual improvement between the two tasks. This is driven by a ranking-aware verifiable reward that jointly assesses regression precision and ranking accuracy, facilitating direct model updates via policy optimization. To further enhance training, we introduce Response Mutation Operations (RMO), which inject controlled noise to improve exploration and prevent stagnation at saddle points. The effectiveness of RARL is validated through extensive experiments on three distinct benchmarks.

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. Any repos shown below are weak matches — 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{hao2026rankingaware,
  title  = {Ranking-aware Reinforcement Learning for Ordinal Ranking},
  author = {Aiming Hao and Chen Zhu and Jiashu Zhu and Jiahong Wu and Xiangxiang Chu},
  year   = {2026},
  eprint = {2601.20585},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.20585v1}
}

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/2601.20585.svg)](https://codeofpaper.com/paper/2601.20585)

Discussion