Backend
Keep it Simple! A Multiple-Choice Task can Benefit Generative Recommendation
arXiv cs.IR0 views
arXiv:2611.19320v2 Announce Type: replace Abstract: Sequential recommendation has recently witnessed growing interest in generative retrieval. One of the most popular approaches is to autoregressively generate the semantic identifiers (SIDs) of items as recommendations. Existing efforts mainly rely on semantic alignment, sophisticated architectural designs, and extensive hyperparameter tuning. However, the conventional learning framework for generative models could have foundational limitations. Specifically, most generative models directly predict target items without explicitly learning negative compositions and relative ranking signals. This is not well aligned with the philosophy of Bayesian personalized ranking (BPR), which emphasizes the importance of relative rankings between positive and negative samples. In this paper, we show that adding a simple multiple-choice auxiliary task into the learning objective can effectively address this issue. With minimal adaptation, we introduce Task Identifiers and Candidate Constructions to synthesize training data for the multiple-choice auxiliary task. In addition, we provide theoretical analysis of the fundamental benefits of the multiple-choice auxiliary task from the perspectives of information theory and compositional generalization. Extensive experiments on four publicly available benchmark datasets show that our approach can improve TIGER, a conventional generative recommendation model, by 4.9% to 79% in NDCG@10.
Source:https://arxiv.org/abs/2611.19320PreviousThe Missing Complement: State-Conditioned Minimal Sufficient Evidence for Coding AgentsNextMMIntentFlow: An Intent-Driven Real-Time Multimodal Search System with Image-Text Queries at Xiaohongshu
Related posts
pytrends trending_searches() returns 404: how to get Google trending searches in Python (2026)
0dev.to
How We Built 225+ Static Developer Tools & Precision Calculators with Next.js Turbopack and 0ms Latency
0dev.to
Claude Code auto mode unavailable or classifier blocked
0dev.to

My MCP Scanner Scored 0 of 2 on a Real CVE. Here Is What Found It Instead
0dev.to
Most of the AI Agents on GitHub Are While Loops in a Trench Coat
0dev.to

The Key Expires in 24 Hours. The Retry Arrives on Monday.
0dev.to