Pith. sign in

REVIEW 4 cited by

GRN: Generative Rerank Network for Context-wise 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 2104.00860 v2 pith:3ZY4DAJQ submitted 2021-04-02 cs.IR

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

Reranking is attracting incremental attention in the recommender systems, which rearranges the input ranking list into the final rank-ing list to better meet user demands. Most existing methods greedily rerank candidates through the rating scores from point-wise or list-wise models. Despite effectiveness, neglecting the mutual influence between each item and its contexts in the final ranking list often makes the greedy strategy based reranking methods sub-optimal. In this work, we propose a new context-wise reranking framework named Generative Rerank Network (GRN). Specifically, we first design the evaluator, which applies Bi-LSTM and self-attention mechanism to model the contextual information in the labeled final ranking list and predict the interaction probability of each item more precisely. Afterwards, we elaborate on the generator, equipped with GRU, attention mechanism and pointer network to select the item from the input ranking list step by step. Finally, we apply cross-entropy loss to train the evaluator and, subsequently, policy gradient to optimize the generator under the guidance of the evaluator. Empirical results show that GRN consistently and significantly outperforms state-of-the-art point-wise and list-wise methods. Moreover, GRN has achieved a performance improvement of 5.2% on PV and 6.1% on IPV metric after the successful deployment in one popular recommendation scenario of Taobao application.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. DIRECTOR: Dynamic Index-based Recommendation with Transport-Optimized Retrieval

    cs.IR 2026-07 conditional novelty 6.0 of 10

    A parallel non-autoregressive reranker that trains with capacity-constrained optimal transport and decodes with global hard matching improves slate recommendation quality and serving efficiency.

  2. 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.

  3. PSG: Pair-Space Generation for Efficient Generative Reranking

    cs.IR 2026-07 conditional novelty 4.0 of 10

    PSG halves autoregressive decoding steps for list reranking by generating ordered item pairs as single tokens, claiming ~2-4x speedup and ~4x lower worst-case error, with a 1.83x latency win and 0.178% stay-time lift online.

  4. Breaking the Likelihood Trap: Consistent Generative Recommendation with Graph-structured Model

    cs.IR 2025-10 conditional novelty 4.0 of 10

    CONGRATS uses a DAG-structured positional decoder and evaluator-in-the-loop training to generate more diverse and accurate recommendation lists, showing offline and Kuaishou A/B gains.

Pith tools