Sparse Enhanced Network: An Adversarial Generation Method for Robust Augmentation in Sequential Recommendation
Junyang Chen, Guoxuan Zou, Pan Zhou, Yirui Wu, Zhenghan Chen, Houcheng Su, Huan Wang, Zhiguo Gong
Abstract
Sequential Recommendation plays a significant role in daily recommendation systems, such as e-commerce platforms like Amazon and Taobao. However, even with the advent of large models, these platforms often face sparse issues in the historical browsing records of individual users due to new users joining or the introduction of new products. As a result, existing sequence recommendation algorithms may not perform well. To address this, sequence-based data augmentation methods have garnered attention.
Existing sequence enhancement methods typically rely on augmenting existing data, employing techniques like cropping, masking prediction, random reordering, and random replacement of the original sequence. While these methods have shown improvements, they often overlook the exploration of the deep embedding space of the sequence. To tackle these challenges, we propose a Sparse Enhanced Network (SparseEnNet), which is a robust adversarial generation method. SparseEnNet aims to fully explore the hidden space in sequence recommendation, generating more robust enhanced items. Additionally, we adopt an adversarial generation method, allowing the model to differentiate between data augmentation categories and achieve better prediction performance for the next item in the sequence. Experiments have demonstrated that our method achieves a remarkable 4-14% improvement over existing methods when evaluated on the real-world datasets. (https://github.com/junyachen/SparseEnNet)
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1d690f5c-0285-46d2-be18-329e9f50c225Cited by top-tier papers1
Ask how each one uses itBuilds on8
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He et al.SIGIR 2021 · 1,476 citations
- Contrastive Learning for Sequential RecommendationXu Xie, Fei Sun, Zhaoyang Liu, Shiwen Wu et al.ICDE 2022 · 674 citations
- Self-Supervised Hypergraph Convolutional Networks for Session-based RecommendationXin Xia, Hongzhi Yin, Junliang Yu, Qinyong Wang et al.AAAI 2021 · 615 citations
- Intent Contrastive Learning for Sequential RecommendationYongjun Chen, Zhiwei Liu, Jia Li, Julian J. McAuley et al.WWW 2022 · 429 citations
Related papers
- De-collapsing User Intent: Adaptive Diffusion Augmentation with Mixture-of-Experts for Sequential RecommendationXiaoxi Cui, Chao Zhao, Yurong Cheng, Xiangmin ZhouAAAI 2026
- Data Augmentation as Free Lunch: Exploring the Test-Time Augmentation for Sequential RecommendationYizhou Dang, Yuting Liu, Enneng Yang, Minhan Huang et al.SIGIR 2025 · 10 citations
- Graph Masked Autoencoder for Sequential RecommendationYaowen Ye, Lianghao Xia, Chao HuangSIGIR 2023 · 63 citations
- Is Contrastive Learning Necessary? A Study of Data Augmentation vs Contrastive Learning in Sequential RecommendationPeilin Zhou, You-Liang Huang, Yueqi Xie, Jingqi Gao et al.WWW 2024 · 36 citations
- Tail-Aware Data Augmentation for Long-Tail Sequential RecommendationYizhou Dang, Zhifu Wei, Minhan Huang, Lianbo Ma et al.WWW 2026
