Paper
Constraint-Aware Generative Re-ranking for Multi-Objective Optimization in Advertising Feeds
Authors
Chenfei Li, Hantao Zhao, Weixi Yao, Ruiming Huang, Rongrong Lu, Geng Tian, Dongying Kong
Abstract
Optimizing reranking in advertising feeds is a constrained combinatorial problem, requiring simultaneous maximization of platform revenue and preservation of user experience. Recent generative ranking methods enable listwise optimization via autoregressive decoding, but their deployment is hindered by high inference latency and limited constraint handling. We propose a constraint-aware generative reranking framework that transforms constrained optimization into bounded neural decoding. Unlike prior approaches that separate generator and evaluator models, our framework unifies sequence generation and reward estimation into a single network. We further introduce constraint-aware reward pruning, integrating constraint satisfaction directly into decoding to efficiently generate optimal sequences. Experiments on large-scale industrial feeds and online A/B tests show that our method improves revenue and user engagement while meeting strict latency requirements, providing an efficient neural solution for constrained listwise optimization.
Metadata
Related papers
Fractal universe and quantum gravity made simple
Fabio Briscese, Gianluca Calcagni • 2026-03-25
POLY-SIM: Polyglot Speaker Identification with Missing Modality Grand Challenge 2026 Evaluation Plan
Marta Moscati, Muhammad Saad Saeed, Marina Zanoni, Mubashir Noman, Rohan Kuma... • 2026-03-25
LensWalk: Agentic Video Understanding by Planning How You See in Videos
Keliang Li, Yansong Li, Hongze Shen, Mengdi Liu, Hong Chang, Shiguang Shan • 2026-03-25
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas André, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman • 2026-03-25
The role of spatial context and multitask learning in the detection of organic and conventional farming systems based on Sentinel-2 time series
Jan Hemmerling, Marcel Schwieder, Philippe Rufin, Leon-Friedrich Thomas, Mire... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2603.04227v1</id>\n <title>Constraint-Aware Generative Re-ranking for Multi-Objective Optimization in Advertising Feeds</title>\n <updated>2026-03-04T16:09:36Z</updated>\n <link href='https://arxiv.org/abs/2603.04227v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2603.04227v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>Optimizing reranking in advertising feeds is a constrained combinatorial problem, requiring simultaneous maximization of platform revenue and preservation of user experience. Recent generative ranking methods enable listwise optimization via autoregressive decoding, but their deployment is hindered by high inference latency and limited constraint handling.\n We propose a constraint-aware generative reranking framework that transforms constrained optimization into bounded neural decoding. Unlike prior approaches that separate generator and evaluator models, our framework unifies sequence generation and reward estimation into a single network.\n We further introduce constraint-aware reward pruning, integrating constraint satisfaction directly into decoding to efficiently generate optimal sequences. Experiments on large-scale industrial feeds and online A/B tests show that our method improves revenue and user engagement while meeting strict latency requirements, providing an efficient neural solution for constrained listwise optimization.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='cs.IR'/>\n <published>2026-03-04T16:09:36Z</published>\n <arxiv:comment>14 pages, 2 figures, 3 tables</arxiv:comment>\n <arxiv:primary_category term='cs.IR'/>\n <author>\n <name>Chenfei Li</name>\n </author>\n <author>\n <name>Hantao Zhao</name>\n </author>\n <author>\n <name>Weixi Yao</name>\n </author>\n <author>\n <name>Ruiming Huang</name>\n </author>\n <author>\n <name>Rongrong Lu</name>\n </author>\n <author>\n <name>Geng Tian</name>\n </author>\n <author>\n <name>Dongying Kong</name>\n </author>\n </entry>"
}