Dimos: Diffusion model with unified sequential state space for session-based recommendation

IF 9 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Weiyue Li , Ming Gao , Bowei Chen , Jingmin An , Hao Dong , Wei Jiang , Jiafu Tang
{"title":"Dimos: Diffusion model with unified sequential state space for session-based recommendation","authors":"Weiyue Li ,&nbsp;Ming Gao ,&nbsp;Bowei Chen ,&nbsp;Jingmin An ,&nbsp;Hao Dong ,&nbsp;Wei Jiang ,&nbsp;Jiafu Tang","doi":"10.1016/j.engappai.2026.114131","DOIUrl":null,"url":null,"abstract":"<div><div>Session-based recommendation aims to predict the next item based on the user–item interactions within the current session. Many existing methods adopt discriminative approaches to learn specific preference representations, while few methods introduce generative approaches to learn underlying preference distributions, failing to handle limited and noisy interactions effectively. Moreover, naive implementations of generative models face a trade-off between effectiveness and efficiency, limiting their practical utility. To address these challenges, we propose Dimos, a dual-branch framework comprising an exploring branch and an exploiting branch, which leverage diffusion models and attention networks to capture implicit and explicit preferences, respectively. At the core of Dimos is Bi-MaKAN, a novel backbone architecture featuring a pair of parameter-sharing bidirectional Mamba blocks and a Kolmogorov–Arnold network-based feature fusion layer, designed to enhance both performance and efficiency. To further improve generalization and reduce overfitting, we unify the sequential state spaces of both branches. Additionally, we introduce a linearly weighted fusion mechanism that integrates preference representations from both branches, enabling flexible adjustment of implicit and explicit preference contributions during training and inference. Extensive experiments on three real-world benchmark datasets demonstrate the superiority of Dimos, achieving up to 2.79% improvement in Recall, 3.09% in Mean Reciprocal Rank (MRR), and 3.00% in Normalized Discounted Cumulative Gain (NDCG) over state-of-the-art baselines. Efficiency evaluations show substantial gains, with reductions of 94.32% in Graphics Processing Unit (GPU) memory usage, 66.81% in training time, and 98.80% in inference time. In-depth analyses reveal a collaborative effect between the two branches during both training and inference, with dataset scale modulating their relative importance.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"169 ","pages":"Article 114131"},"PeriodicalIF":9.0000,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Applications of Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0952197626004124","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/2/12 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Session-based recommendation aims to predict the next item based on the user–item interactions within the current session. Many existing methods adopt discriminative approaches to learn specific preference representations, while few methods introduce generative approaches to learn underlying preference distributions, failing to handle limited and noisy interactions effectively. Moreover, naive implementations of generative models face a trade-off between effectiveness and efficiency, limiting their practical utility. To address these challenges, we propose Dimos, a dual-branch framework comprising an exploring branch and an exploiting branch, which leverage diffusion models and attention networks to capture implicit and explicit preferences, respectively. At the core of Dimos is Bi-MaKAN, a novel backbone architecture featuring a pair of parameter-sharing bidirectional Mamba blocks and a Kolmogorov–Arnold network-based feature fusion layer, designed to enhance both performance and efficiency. To further improve generalization and reduce overfitting, we unify the sequential state spaces of both branches. Additionally, we introduce a linearly weighted fusion mechanism that integrates preference representations from both branches, enabling flexible adjustment of implicit and explicit preference contributions during training and inference. Extensive experiments on three real-world benchmark datasets demonstrate the superiority of Dimos, achieving up to 2.79% improvement in Recall, 3.09% in Mean Reciprocal Rank (MRR), and 3.00% in Normalized Discounted Cumulative Gain (NDCG) over state-of-the-art baselines. Efficiency evaluations show substantial gains, with reductions of 94.32% in Graphics Processing Unit (GPU) memory usage, 66.81% in training time, and 98.80% in inference time. In-depth analyses reveal a collaborative effect between the two branches during both training and inference, with dataset scale modulating their relative importance.
Dimos:为基于会话的推荐提供统一顺序状态空间的扩散模型
基于会话的推荐旨在根据当前会话中的用户-项目交互来预测下一个项目。许多现有的方法采用判别方法来学习特定的偏好表示,而很少有方法引入生成方法来学习潜在的偏好分布,无法有效地处理有限的和有噪声的相互作用。此外,生成模型的幼稚实现面临着有效性和效率之间的权衡,限制了它们的实际用途。为了应对这些挑战,我们提出了Dimos,这是一个双分支框架,包括一个探索分支和一个利用分支,它们分别利用扩散模型和注意力网络来捕获隐式和显式偏好。Dimos的核心是Bi-MaKAN,这是一种新型的骨干架构,具有一对参数共享双向Mamba块和基于Kolmogorov-Arnold网络的特征融合层,旨在提高性能和效率。为了进一步提高泛化和减少过拟合,我们统一了两个分支的顺序状态空间。此外,我们引入了一种线性加权融合机制,该机制集成了来自两个分支的偏好表示,从而能够在训练和推理期间灵活调整隐式和显式偏好贡献。在三个真实世界基准数据集上的大量实验证明了Dimos的优越性,与最先进的基线相比,召回率提高了2.79%,平均倒数秩(MRR)提高了3.09%,归一化贴现累积增益(NDCG)提高了3.00%。效率评估显示了巨大的收益,图形处理单元(GPU)内存使用减少了94.32%,训练时间减少了66.81%,推理时间减少了98.80%。深入分析揭示了训练和推理过程中两个分支之间的协作效应,数据集规模调节了它们的相对重要性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Engineering Applications of Artificial Intelligence
Engineering Applications of Artificial Intelligence 工程技术-工程:电子与电气
CiteScore
9.60
自引率
10.00%
发文量
505
审稿时长
68 days
期刊介绍: Artificial Intelligence (AI) is pivotal in driving the fourth industrial revolution, witnessing remarkable advancements across various machine learning methodologies. AI techniques have become indispensable tools for practicing engineers, enabling them to tackle previously insurmountable challenges. Engineering Applications of Artificial Intelligence serves as a global platform for the swift dissemination of research elucidating the practical application of AI methods across all engineering disciplines. Submitted papers are expected to present novel aspects of AI utilized in real-world engineering applications, validated using publicly available datasets to ensure the replicability of research outcomes. Join us in exploring the transformative potential of AI in engineering.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书