paper-with-me

Papers

Calibration-Disentangled Learning and Relevance-Prioritized Reranking for Calibrated Sequential Recommendation

2024-08-04 · Hyunsik Jeon, Se-eun Yoon, Julian McAuley

Calibrated recommendation, which aims to maintain personalized proportions of categories within recommendations, is crucial in practical scenarios since it enhances user satisfaction by reflecting diverse interests. However, achieving calibration in a sequential setting (i.e., calibrated sequential recommendation) is challenging due to the need to adapt to users' evolving preferences. Previous methods typically leverage reranking algorithms to calibrate recommendations after training a model without considering the effect of calibration and do not effectively tackle the conflict between relevance and calibration during the reranking process. In this work, we propose LeapRec (Calibration-Disentangled Learning and Relevance-Prioritized Reranking), a novel approach for the calibrated sequential recommendation that addresses these challenges. LeapRec consists of two phases, model training phase and reranking phase. In the training phase, a backbone model is trained using our proposed calibration-disentangled learning-to-rank loss, which optimizes personalized rankings while integrating calibration considerations. In the reranking phase, relevant items are prioritized at the top of the list, with items needed for calibration following later to address potential conflicts between relevance and calibration. Through extensive experiments on four real-world datasets, we show that LeapRec consistently outperforms previous methods in the calibrated sequential recommendation. Our code is available at https://github.com/jeon185/LeapRec.

📄 PDF Abstract BibTeX arXiv:2408.02156

Code (1)

jeon185/leaprec 공식 구현 pytorch

Tasks

Learning-To-RankRerankingSequential Recommendation

Similar Papers 제목 키워드 기반

Self-Calibrated Listwise Reranking with Large Language Models

2024-11-07 · Ruiyang Ren, Yuhao Wang, Kun Zhou, Wayne Xin Zhao 외

Large language models (LLMs), with advanced linguistic capabilities, have been employed in reranking tasks through a sequence-to-sequence approach. In this paradigm, multiple passages are reranked in a listwise manner an…

Reranking

Zero-shot Vision-Language Reranking for Cross-View Geolocalization

2026-03-28 · Yunus Talha Erzurumlu, John E. Anderson, William J. Shuart, Charles Toth 외 arxiv

Cross-view geolocalization (CVGL) systems, while effective at retrieving a list of relevant candidates (high Recall@k), often fail to identify the single best match (low Top-1 accuracy). This work investigates the use of…

DeAR: Dual-Stage Document Reranking with Reasoning Agents via LLM Distillation

2025-08-23 · Abdelrahman Abdallah, Jamshid Mozafari, Bhawna Piryani, Adam Jatowt arxiv

Large Language Models (LLMs) have transformed listwise document reranking by enabling global reasoning over candidate sets, yet single models often struggle to balance fine-grained relevance scoring with holistic cross-d…

Natural Questions

On the Calibration and Uncertainty of Neural Learning to Rank Models

2021-01-12 · Gustavo Penha, Claudia Hauff

According to the Probability Ranking Principle (PRP), ranking documents in decreasing order of their probability of relevance leads to an optimal document ranking for ad-hoc retrieval. The PRP holds when two conditions a…

Document RankingLearning-To-RankRetrieval

On the Calibration and Uncertainty of Neural Learning to Rank Models for Conversational Search

2021-04-01 · EACL 2021 2 · Gustavo Penha, Claudia Hauff

According to the Probability Ranking Principle (PRP), ranking documents in decreasing order of their probability of relevance leads to an optimal document ranking for ad-hoc retrieval. The PRP holds when two conditions a…

Conversational SearchDocument RankingLearning-To-RankRetrieval