根据语义标识位置重要性动态分配计算资源,提升生成推荐精度
Where Reasoning Matters: Rethinking Latent Reasoning in Semantic ID-based Generative Recommendation

- 将推理步骤视为有限资源,按各位置信息增益分配
- 在多个数据集上提升推荐准确率,且更省计算资源
- 适合追求高效率与精准度平衡的生成式推荐系统研究者
语义ID生成推荐通过自回归生成一串语义ID标记来预测物品。近期引入隐式推理机制,在每个标记决策前进行额外隐藏状态计算。但关键问题是:应为每个位置分配相同数量的隐式精炼步骤,还是按需分配?我们通过位置信息增益(IG)分析发现,早期语义ID位置通常提供更高信息增益,后期贡献较小。进一步分析表明,对高IG位置投入更多精炼步骤能带来更大预期收益。基于此,提出IBA框架——一种基于信息增益预算分配的生成推荐方法。IBA将隐式精炼步数视为有限计算资源,学习如何在不同位置间分配,使高信息量位置获得更多精炼,低贡献位置减少消耗。多组公开数据集实验表明,IBA持续优于强基线模型,在准确率与计算开销之间取得更优平衡。
原文摘要 · Abstract (English)
Semantic ID-based generative recommendation predicts an item by generating a short sequence of semantic ID tokens, where each token is produced autoregressively. Latent reasoning has recently been introduced to improve this process through additional hidden-state computation before each token decision. This raises a practical question: when one item is represented by a sequence of semantic ID tokens, should each token receive the same fixed number of latent refinement steps, or should these steps be allocated more effectively across positions? We study this question through position-wise information-gain (IG), which measures how much each semantic ID position reduces the uncertainty of the target item. We observe that earlier semantic ID positions usually provide higher information-gain, while later positions contribute less additional information. We further analyze that applying more refinement to high-IG positions tends to bring larger expected benefits. Based on this observation, we propose IBA, an Information-Gain Budget Allocation framework for semantic ID-based generative recommendation. IBA treats latent refinement steps as a limited computational resource and learns how to allocate them across semantic ID positions, assigning more refinement to informative positions and less to positions with smaller contribution. Experiments on multiple public datasets show that IBA consistently improves strong generative recommendation baselines and achieves a better accuracy--computation trade-off than fixed or poorly matched step allocations.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。