REVIEW 9 cited by
Seq2Slate: Re-ranking and Slate Optimization with RNNs
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
Seq2Slate: Re-ranking and Slate Optimization with RNNs
read the original abstract
Ranking is a central task in machine learning and information retrieval. In this task, it is especially important to present the user with a slate of items that is appealing as a whole. This in turn requires taking into account interactions between items, since intuitively, placing an item on the slate affects the decision of which other items should be placed alongside it. In this work, we propose a sequence-to-sequence model for ranking called seq2slate. At each step, the model predicts the next `best' item to place on the slate given the items already selected. The sequential nature of the model allows complex dependencies between the items to be captured directly in a flexible and scalable way. We show how to learn the model end-to-end from weak supervision in the form of easily obtained click-through data. We further demonstrate the usefulness of our approach in experiments on standard ranking benchmarks as well as in a real-world recommendation system.
Forward citations
Cited by 9 Pith papers
-
UniRank: Unified List-wise Reranking via Confidence-Ordered Denoising
UniRank unifies autoregressive and non-autoregressive list-wise reranking via bidirectional modeling in a confidence-ordered iterative denoising process, outperforming baselines on datasets and online tests.
-
Limitations of LTI Koopman Modeling for Nonlinear Control Systems
Exact LTI Koopman models for nonlinear control systems require affine linear dynamics under controllability and coordinate inclusion assumptions.
-
Next-Scale Generative Reranking: A Tree-based Generative Rerank Method at Meituan
NSGR is a tree-structured generative reranker that progressively generates optimal lists via next-scale expansion and multi-scale neighbor loss to balance perspectives and align training signals.
-
From Local Indices to Global Identifiers: Generative Reranking for Recommender Systems via Global Action Space
GloRank reformulates list-wise reranking as token generation over a global item identifier space, using supervised pre-training followed by reinforcement learning to maximize list-wise utility and outperforming baseli...
-
SCASRec: A Self-Correcting and Auto-Stopping Model for Generative Route List Recommendation
SCASRec unifies ranking and redundancy elimination for route lists via stepwise corrective rewards and an adaptive end-of-recommendation token, claiming SOTA results on two datasets and real deployment.
-
DeGRe: Dense-supervised Generative Reranking for Recommendation
DeGRe decouples offline exploration via a lookahead evaluator using beam search and cumulative regression to distill dense supervision into an online generator that approximates optimal reranking sequences with greedy...
-
Limitations of LTI Koopman Modeling for Nonlinear Control Systems
Exact LTI Koopman models for controllable nonlinear systems with full-state observables must have affine-linear dynamics.
-
Rich-Media Re-Ranker: A User Satisfaction-Driven LLM Re-ranking Framework for Rich-Media Search
A re-ranking system for rich-media search that plans query intents from sessions, adds visual signals from VLMs, and uses an LLM to score results on multiple facets before multi-task RL adaptation, with reported gains...
-
Dual-Rerank: Fusing Causality and Utility for Industrial Generative Reranking
Dual-Rerank fuses autoregressive and non-autoregressive generative reranking via knowledge distillation and uses list-wise decoupled RL optimization to improve whole-page utility and cut latency in industrial video search.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.