在關鍵之處加深處理:LoopRec 的序列推薦項目級自適應遞迴
Think Harder Where It Matters: Item-Level Adaptive Recursion for Sequential Recommendation
LoopRec 為序列推薦提出項目級自適應遞迴,按每個歷史項目的需要分配處理深度。它重複使用共享權重的骨幹區塊,由輕量閘門決定逐項退出或繼續,無需輔助深度標籤。3 個 Amazon 基準的 4 種骨幹模型共 48 項排序比較均有提升,其中 44 項具統計顯著性;Patio 上 NextItNet 的 NDCG@20 由 0.0192 升至 0.0263(+37.02%)。
🧠 Every interaction gets the same compute. Should it?
Introducing LoopRec, from our paper Think Harder Where It Matters: Item-Level Adaptive Recursion for Sequential Recommendation. We explore a simple idea: let each historical item learn how deeply it needs to be processed.
🔍 The evidence behind adaptive depth
In a three-layer SASRec diagnostic on Amazon Office, 76.14% of items stabilize after one layer, while 6.72% require all three. Shallow and deep computational needs coexist within the same history.
🔁 One shared block, different depths
LoopRec reuses a weight-shared backbone block recursively. Lightweight gates decide, item by item, whether to exit or continue—without auxiliary depth labels. Learned routing allocates deeper computation to rarer items and more recent interactions.
📈 Consistent gains across architectures
Across 3 Amazon benchmarks × 4 backbones—SASRec, BSARec, NextItNet, and LRURec—all 48 reported ranking comparisons improve; 44 are statistically significant. On Patio, NextItNet's NDCG@20 rises from 0.0192 to 0.0263 (+37.02%).
💡 Adaptive computation opens a promising direction for recommendation: learning where additional depth is useful within each user's history.
📄 Paper: https://arxiv.org/abs/2610.30128
💻 Code: https://github.com/Elpmis117/LoopRec
We'd love to hear your thoughts on adaptive depth for recommender systems! 🤗
來源:HuggingFace Daily Papers(社區熱門論文) · huggingface.co