Pith. sign in

REVIEW 1 cited by

Context-aware Reranking with Utility Maximization for Recommendation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.09059 v2 pith:H2SJ6S3S submitted 2021-10-18 cs.IR

classification cs.IR
keywords rerankingutilitycontextitemslistsrecommendationcontext-awarecounterfactual
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. NLGR: Utilizing Neighbor Lists for Generative Rerank in Personalized Recommendation Systems

    cs.IR 2025-02 conditional novelty 6.0 of 10

    Training a generative re-ranker on relative scores of neighboring item lists, plus a sampling-based non-autoregressive decoder, improves CTR and GMV in Meituan's food delivery recommender.

Pith tools