Context-aware Reranking with Utility Maximization for Recommendation
As a critical task for large-scale commercial recommender systems, reranking has shown the potential of improving recommendation results by uncovering mutual influence among items. Reranking rearranges items in the initial ranking lists from the previous ranking stage to better meet users' demands. However, rather than considering the context of initial lists as most existing methods do, an ideal reranking algorithm should consider the counterfactual context -- the position and the alignment of the items in the reranked lists. In this work, we propose a novel pairwise reranking framework, Context-aware Reranking with Utility Maximization for recommendation (CRUM), which maximizes the overall utility after reranking efficiently. Specifically, we first design a utility-oriented evaluator, which applies Bi-LSTM and graph attention mechanism to estimate the listwise utility via the counterfactual context modeling. Then, under the guidance of the evaluator, we propose a pairwise reranker model to find the most suitable position for each item by swapping misplaced item pairs. Extensive experiments on two benchmark datasets and a proprietary real-world dataset demonstrate that CRUM significantly outperforms the state-of-the-art models in terms of both relevance-based metrics and utility-based metrics.
Code (0)
등록된 구현이 없습니다.
Tasks
counterfactualGraph AttentionPositionRecommendation SystemsRerankingSimilar Papers 제목 키워드 기반
Discrete Conditional Diffusion for Reranking in Recommendation
Reranking plays a crucial role in modern multi-stage recommender systems by rearranging the initial ranking list to model interplay between items. Considering the inherent challenges of reranking such as combinatorial se…
Recommendation SystemsRerankingPrompt-Based LLMs for Position Bias-Aware Reranking in Personalized Recommendations
Recommender systems are essential for delivering personalized content across digital platforms by modeling user preferences and behaviors. Recently, large language models (LLMs) have been adopted for prompt-based recomme…
PositionRecommendation SystemsRerankingNon-monotone Sequential Submodular Maximization
In this paper, we study a fundamental problem in submodular optimization, which is called sequential submodular maximization. Specifically, we aim to select and rank a group of $k$ items from a ground set $V$ such that t…
Assortment OptimizationDiversityRecommendation SystemsProfiling What Matters: Context-Aware Item Profiles from Large-Scale Metadata for LLM Recommenders
While Large Language Models (LLMs) have significantly advanced reranking in recommendation, effectively leveraging item-side information remains challenging. Real-world items are described by vast, heterogeneous, and uns…
Local Citation Recommendation with Hierarchical-Attention Text Encoder and SciBERT-based Reranking
The goal of local citation recommendation is to recommend a missing reference from the local citation context and optionally also from the global context. To balance the tradeoff between speed and accuracy of citation re…
Citation RecommendationReranking