paper-with-me

홈 › Papers

GReF: A Unified Generative Framework for Efficient Reranking via Ordered Multi-token Prediction

2025-10-29 · Zhijie Lin, Zhuofeng Li, Chenglei Dai, Wentian Bao, Shuai Lin, Enyun Yu, Haoxiang Zhang, Liang Zhao arxiv

In a multi-stage recommendation system, reranking plays a crucial role in modeling intra-list correlations among items. A key challenge lies in exploring optimal sequences within the combinatorial space of permutations. Recent research follows a two-stage (generator-evaluator) paradigm, where a generator produces multiple feasible sequences, and an evaluator selects the best one. In practice, the generator is typically implemented as an autoregressive model. However, these two-stage methods face two main challenges. First, the separation of the generator and evaluator hinders end-to-end training. Second, autoregressive generators suffer from inference efficiency. In this work, we propose a Unified Generative Efficient Reranking Framework (GReF) to address the two primary challenges. Specifically, we introduce Gen-Reranker, an autoregressive generator featuring a bidirectional encoder and a dynamic autoregressive decoder to generate causal reranking sequences. Subsequently, we pre-train Gen-Reranker on the item exposure order for high-quality parameter initialization. To eliminate the need for the evaluator while integrating sequence-level evaluation during training for end-to-end optimization, we propose post-training the model through Rerank-DPO. Moreover, for efficient autoregressive inference, we introduce ordered multi-token prediction (OMTP), which trains Gen-Reranker to simultaneously generate multiple future items while preserving their order, ensuring practical deployment in real-time recommender systems. Extensive offline experiments demonstrate that GReF outperforms state-of-the-art reranking methods while achieving latency that is nearly comparable to non-autoregressive models. Additionally, GReF has also been deployed in a real-world video app Kuaishou with over 300 million daily active users, significantly improving online recommendation quality.

📄 PDF Abstract BibTeX arXiv:2510.25220

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

MAGREF: Masked Guidance for Any-Reference Video Generation

2025-05-29 · Yufan Deng, Xun Guo, Yuanyang Yin, Jacob Zhiyuan Fang 외

Video generation has made substantial strides with the emergence of deep generative models, especially diffusion-based approaches. However, video generation based on multiple reference subjects still faces significant ch…

Human-Domain Subject-to-VideoOpen-Domain Subject-to-VideoSingle-Domain Subject-to-VideoVideo Generation

Dual-Rerank: Fusing Causality and Utility for Industrial Generative Reranking

2026-04-08 · Chao Zhang, Shuai Lin, ChengLei Dai, Ye Qian 외 arxiv

Kuaishou serves over 400 million daily active users, processing hundreds of millions of search queries daily against a repository of tens of billions of short videos. As the final decision layer, the reranking stage dete…

Reinforcement LearningKnowledge Distillation

DMFlow: Disordered Materials Generation by Flow Matching

2026-02-04 · Liming Wu, Rui Jiao, Qi Li, Mingze Li 외 arxiv

The design of materials with tailored properties is crucial for technological progress. However, most deep generative models focus exclusively on perfectly ordered crystals, neglecting the important class of disordered m…

Graph Neural Network

NegRefine: Refining Negative Label-Based Zero-Shot OOD Detection

2025-07-13 · Amirhossein Ansari, Ke Wang, Pulei Xiong arxiv

Recent advancements in Vision-Language Models like CLIP have enabled zero-shot OOD detection by leveraging both image and textual label information. Among these, negative label-based methods such as NegLabel and CSP have…

Rank It, Then Ask It: Input Reranking for Maximizing the Performance of LLMs on Symmetric Tasks

2024-11-30 · Mohsen Dehghankar, Abolfazl Asudeh

Large language models (LLMs) have quickly emerged as practical and versatile tools that provide new solutions for a wide range of domains. In this paper, we consider the application of LLMs on symmetric tasks where a que…

Reranking