arXiv cs.AI· Tripti Shukla, Shwetha Somasundaram, Akshat Gupta, Rohit Garg, Paul Duff, Ian Anderson·· 3 天前AI 评分20
HASTE:面向生成式推荐的分层与属性感知监督框架
HASTE: Hierarchical and Attribute-aware Supervision for Generative Recommendation
AI 导读
HASTE 是一个面向生成式推荐模型的统一训练框架,通过分层损失和属性特定损失,在语义 ID 的每一层级提供监督并保留细粒度物品属性。其分层损失收敛速度约为标准因果交叉熵目标的 2 倍,并在时尚推荐基准和 Amazon 数据集多个领域上提升了推荐性能,尤其改善了长尾物品的推荐效果。
正文 · 原文
Abstract:Generative recommendation models have shown promising results by representing items as semantic IDs and generating these IDs autoregressively. We introduce an approach showing that explicitly incorporating hierarchical and attribute-level supervision into generative recommendation can simultaneously improve training efficiency and long-tail recommendation performance. Existing approaches typically optimize semantic ID prediction with a standard causal cross-entropy objective, which does not explicitly exploit the hierarchical structure of semantic IDs and can require substantial training to learn effective item representations. Moreover, data-sparse tail items often suffer from poor representations due to limited supervision, resulting in weaker long-tail recommendation performance. We address these challenges with HASTE (Hierarchical and Attribute-aware Supervision for generaTive rEcommendation), a unified training framework that introduces hierarchical and attribute-specific supervision. HASTE's Hierarchical Loss explicitly exploits the multi-level structure of semantic IDs, providing supervision at each level of the item hierarchy and substantially accelerating training convergence. Its Attribute-Specific Losses encourage the model to preserve fine-grained item attributes, leveraging the language model's inherent semantic knowledge to improve representations and recommendations for tail items. We extensively evaluate HASTE on a fashion recommendation benchmark and across multiple domains of the Amazon dataset. HASTE improves recommendation performance across datasets and item-frequency regimes. Notably, the Hierarchical Loss achieves approximately 2x faster convergence than the standard causal cross-entropy objective, substantially improving training efficiency while maintaining strong recommendation quality.
| Subjects: | Information Retrieval (cs.IR); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) |
| Cite as: | arXiv:2610.17368 [cs.IR] |
| (or arXiv:2610.17368v1 [cs.IR] for this version) | |
| https://doi.org/10.48550/arXiv.2610.17368 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Tripti Shukla [view email]
[v1]
Mon, 12 Oct 2026 20:25:50 UTC (635 KB)
来源:arXiv cs.AI · arxiv.org