OpenResearchAlpha

ACM Transactions on Information Systems · 12 Nov 2026

Reinforcement Learning to Rank Using Coarse-grained Rewards

Yiteng Tuh-index 4, Zhichao Xu, Tao Yang, Weihang Su, Yujia Zhou, Yiqun Liu, Qingyao Aih-index 26

0
Citations
no database records one yet
0
Citations in 2026
so far
26
Leading author's h-index
Qingyao Ai, in QAI's scholar index
47
References
works it cites, from open citation data

Citations by database

Each database indexes a different set of journals, preprints and books, so they are shown side by side rather than blended.

  • OpenCitations0
  • Crossref0

Citations per year

The current year is still counting.

  • 2026 so far0

Abstract

Learning to rank (LTR) plays a crucial role in various Information Retrieval (IR) tasks. Although supervised LTR methods based on fine-grained relevance labels (e.g., document-level annotations) have achieved significant success, their reliance on costly and potentially biased annotations limits scalability and alignment with realistic goals. In contrast, coarse-grained feedback signals, such as duration time and session-level engagement, are more accessible and affordable. Reinforcement Learning (RL) offers a promising framework to directly optimize these objectives using reward signals, but most existing Reinforcement Learning to Rank (RLTR) approaches suffer from high variance and low sample efficiency. Motivated by recent advances in large language models (LLMs), we re-examine the problem of RLTR with coarse-grained rewards and propose new RLTR methods based on widely used RL algorithms for LLMs. We systematically compare supervised learning and RL-based methods across various model architectures and coarse-grained reward functions on large-scale LTR benchmarks. Experimental results demonstrate that advanced RL methods can directly learn from coarse-grained rewards and outperform strong supervised learning baselines even with fine-grained labels. This shows the great potential of RLTR for metric-agnostic ranking optimization. We release our code at: https://github.com/StibiumT16/RLTR .

What the data shows

  • No database records a citation yet, as is usual for a paper this new.
  • Qingyao Ai has the highest h-index among the authors (26).

Graph

This paper in the middle, its authors and their most-cited papers below, the papers it cites to the left and the papers citing it to the right. The timeline lays every paper out by year.

Citing paper shares an authorAuthor without a profileSize shows citations, or h-index for authors

Select a node for its details. Drag to pan, scroll to zoom, drag a node to move it.

Start with

Authors (7)

Each author's standing in QAI's scholar index: the works their ORCID iD is attached to, and for anyone whose ORCID record names a lab OpenResearch follows, their arXiv preprints matched by name and a shared co-author. Names are as printed on the paper.

ProfileMost-cited paper

Cited by 0 papers

Who cites this paper, from open citation data, with Crossref's record of each; the 100 newest when there are more.

0 shown
No citing papers for this filter.

References (47)

What it cites, from open citation data, with Crossref's record of each.

Learning to rank
Proceedings of the 24th international conference on Machine learning · 2007
1,437

Sign in to see 27 more references

A free account opens the rest of the citing papers and references on every paper’s page.