mlsanityData to 7 Oct 2026

RLPO: Residual Listwise Preference Optimization for Long-Context Review Ranking

arXiv 2601.07449 ↗First posted 12 Jan 2026cs.IR cs.AIcited by 3

On the map: LLM alignment / RLHF / preference optimisation → Preference alignment for recommenders and RAG

Abstract (arXiv)

Review ranking is pivotal in e-commerce for prioritizing diagnostic and authentic feedback from the deluge of user-generated content. While large language models have improved semantic assessment, existing ranking paradigms face a persistent trade-off in long-context settings. Pointwise scoring is efficient but often fails to account for list-level interactions, leading to miscalibrated top-k rankings. Listwise approaches can leverage global context, yet they are computationally expensive and become unstable as candidate lists grow. To address this, we propose Residual Listwise Preference Optimization (RLPO), which formulates ranking as listwise representation-level residual correction over a strong pointwise LLM scorer. RLPO first produces calibrated pointwise scores and item representations, then applies a lightweight encoder over the representations to predict listwise score residuals, avoiding full token-level listwise processing. We also introduce a large-scale benchmark for long-context review ranking with human verification. Experiments show RLPO improves NDCG@k over strong pointwise and listwise baselines and remains robust as list length increases.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Placed in Preference alignment for recommenders and RAG, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 19 of its 39 references that are in the map. First posted on arXiv 12 Jan 2026.

Builds on

19 of 39 references.

Closest ancestors · 1

Same direction, newest first

  1. 2024On Softmax Direct Preference Optimization for Recommendation13 Jun

Other references · 18

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2023Large Language Models for Information Retrieval: A Surveycited by 331
  4. 2023Large Language Models are Effective Text Rankers with Pairwise Ranking Promptingcited by 302
  5. 2024Bridging Language and Items for Retrieval and Recommendation: Benchmarking LLMs as Semantic Encoderscited by 213
  6. 2013A Theoretical Analysis of NDCG Type Ranking Measurescited by 119
  7. 2015Yara Parser: A Fast and Accurate Dependency Parsercited by 110
  8. 2024LiPO: Listwise Preference Optimization through Learning-to-Rankcited by 94
  9. 2024FIRST: Faster Improved Listwise Reranking with Single Token Decodingcited by 54
  10. 2024JuStRank: Benchmarking LLM Judges for System Rankingcited by 27
  11. 2020A Transformer-based Embedding Model for Personalized Product Searchcited by 15
  12. 2025LLM4Ranking: An Easy-to-use Framework of Utilizing Large Language Models for Document Rerankingcited by 12
6 more
  1. 2025CoRanking: Collaborative Ranking with Small and Large Ranking Agentscited by 10
  2. 2025Scalable In-context Ranking with Generative Modelscited by 8
  3. 2025Precise Zero-Shot Pointwise Ranking with LLMs through Post-Aggregated Global Context Informationcited by 6
  4. 2025Leveraging Reference Documents for Zero-Shot Ranking via Large Language Modelscited by 2
  5. 2025Unbiased Learning to Rank with Query-Level Click Propensity Estimation: Beyond Pointwise Observation and Relevancecited by 1
  6. 2025Harnessing Pairwise Ranking Prompting Through Sample-Efficient Ranking Distillationcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025In-context Ranking Preference Optimization
  2. 2025Listwise Preference Alignment Optimization for Tail Item Recommendation
  3. 2026ZooWork-ShopRanker: An Open, Preference-Aligned E-Commerce Reranker
  4. 2025Language Ranker: A Lightweight Ranking framework for LLM Decoding
  5. 2026CALMRec: Causally Aligned Language Memory for Long-Horizon Recommendation
  6. 2025GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs
  7. 2025On Negative-aware Preference Optimization for Recommendation
  8. 2024Leveraging Passage Embeddings for Efficient Listwise Reranking with Large Language Models