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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Counterfactual Multi-player Bandits for Explainable Recommendation Diversification
Journalism-Guided Agentic In-Context Learning for News Stance Detection
Learning Meta-path-aware Embeddings for Recommender Systems
A Reproducibility Study of Product-side Fairness in Bundle Recommendation
Car Object Counting and Position Estimation via Extension of the CLIP-EBC Framework
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.