Length-Adaptive Interest Network for Balancing Long and Short Sequence Modeling in CTR Prediction
Zhicheng Zhang, Zhaocheng Du, Jieming Zhu, Jiwei Tang, Fengyuan Lu, Wang Jiaheng, Song-Li Wu, Qianhui Zhu, Jingyu Li, Hai-Tao Zheng, Zhenhua Dong
Abstract
User behavior sequences in modern recommendation systems exhibit significant length heterogeneity, ranging from sparse short-term interactions to rich long-term histories. While longer sequences provide more context, we observe that increasing the maximum input sequence length in existing CTR models paradoxically degrades performance for short-sequence users due to attention polarization and length imbalance in training data. To address this, we propose LAIN (Length-Adaptive Interest Network), a plug-and-play framework that explicitly incorporates sequence length as a conditioning signal to balance long- and short-sequence modeling. LAIN consists of three lightweight components: a Spectral Length Encoder that maps length into continuous representations, Length-Conditioned Prompting that injects global contextual cues into both long- and short-term behavior branches, and Length-Modulated Attention that adaptively adjusts attention sharpness based on sequence length. Extensive experiments on three real-world benchmarks across five strong CTR backbones show that LAIN consistently improves overall performance, achieving up to 1.15% AUC gain and 2.25% log loss reduction. Notably, our method significantly improves accuracy for short-sequence users without sacrificing long-sequence effectiveness. Our work offers a general, efficient, and deployable solution to mitigate length-induced bias in sequential recommendation.
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 005ec680-7997-4bd6-8b26-bd2c9a70d7d3Cited by top-tier papers3
- BlossomRec: Block-level Fused Sparse Attention Mechanism for Sequential RecommendationsMengyang Ma, Xiaopeng Li, Wanyu Wang, Zhaocheng Du et al.WWW 2026 · 1 citation
- CollectiveKV: Decoupling and Sharing Collaborative Information in Sequential RecommendationJingyu Li, Zhaocheng Du, Qianhui Zhu, Kaiyuan Li et al.ICLR 2026 · 1 citation
- When Hard Negatives Hurt: Bridging the Generative Discriminative Gap in Hard Negative Synthesis for RetrievalZhicheng Zhang, Jiwei Tang, Kuicai Dong, Xiaopeng Li et al.KDD 2026 · 1 citation
Builds on7
- FinalMLP: An Enhanced Two-Stream MLP Model for CTR PredictionKelong Mao, Jieming Zhu, Liangcai Su, Guohao Cai et al.AAAI 2023 · 142 citations
- Efficient Noise-Decoupling for Multi-Behavior Sequential RecommendationYongqiang Han, Hao Wang, Kefan Wang, Likang Wu et al.WWW 2024 · 60 citations
- GMSA: Enhancing Context Compression via Group Merging and Layer Semantic AlignmentJiwei Tang, Zhicheng Zhang, Shunlong Wu, Jingheng Ye et al.ACL 2026 · 24 citations
- Learning Transferrable Parameters for Long-tailed Sequential User Behavior ModelingJianwen Yin, Chenghao Liu, Weiqing Wang, Jianling Sun et al.KDD 2020 · 20 citations
- Empowering General-purpose User Representation with Full-life Cycle Behavior ModelingBei Yang, Jie Gu, Ke Liu, Xiaoxiao Xu et al.KDD 2023 · 9 citations
Related papers
- Iterative Sparse Attention for Long-sequence RecommendationGuanyu Lin, Jinwei Luo, Yinfeng Li, Chen Gao et al.AAAI 2025 · 2 citations
- AutoMLP: Automated MLP for Sequential RecommendationsMuyang Li, Zijian Zhang, Xiangyu Zhao, Wanyu Wang et al.WWW 2023 · 70 citations
- Incremental Learning for Multi-Interest Sequential RecommendationZhikai Wang, Yanyan ShenICDE 2023 · 16 citations
- Improving Long-tail User CTR Prediction via Hierarchical Distribution AlignmentYifan Wang, Weizhi Ma, Min Zhang, Xiaoxiao Xu et al.KDD 2025
- Lifelong Sequential Recommendation with Adaptive Subsequence Compression and Contextual FusionFei Li, Xiaoming Liu, Jiayi Luo, Guibing Guo et al.WWW 2026
