Session 3:

3A: Robust & Adaptive Sequential Recommendation

Date: Tuesday September 29, 16:00 – 17:30 CDT
Session Chair: Harrie Oosterhuis

  • RESAutomated Selection-based Mixture-of-Experts with Dual-stage Input–Target Pattern Learning for Sequential Recommendation
    by Xiaolin Lin, Weike Pan and Zhong Ming

    Sequential recommendation (SR) aims to predict the next items for users by learning the users’ representations from their historical sequences. In this process, most existing methods rely on a single globally shared encoder to model the relationship between input sequences and target items, implicitly learning input–target patterns. However, such implicit learning treats patterns uniformly and largely overlooks their intrinsic characteristics and differences among training samples. Through the empirical studies in this paper, we find that input–target patterns exhibit both conflicting and generalizable characteristics, which impose distinct modeling requirements. Neglecting these properties leads to suboptimal user representations and limited generalization. Motivated by these findings, we propose a novel MoE architecture, Automated Selection-based Mixture-of-Experts (ASMoE), with a dual-stage training scheme to address these issues. In our ASMoE, we introduce an automated expert selection mechanism to adaptively allocate selectable experts and accommodate diverse modeling requirements of input–target patterns. Furthermore, we develop a dual-stage training scheme to enhance our ASMoE for input–target pattern learning. The first stage performs initial learning over diverse patterns. In the second stage, we explicitly construct the potentially generalizable input–target patterns via a category-aware mask generator and a similarity-aware penalty, thereby facilitating the fine-tuning of our ASMoE towards generalizable knowledge. Extensive experiments on four public datasets demonstrate the effectiveness of our ASMoE. The source code and auxiliary material of our ASMoE are provided at https://anonymous.4open.science/r/ASMoE.

  • RESFiCoRec: Fine-Grained Contrastive Learning with Dual Aggregation for Sequential Recommendation
    by Shun Zhang, Ziqiang Yin, Runsen Zhang and Junliang Pan

    Sequential recommendation methods integrated with contrastive learning have been proven effective in addressing the data sparsity issue. However, most contrastive learning schemes directly perform random data augmentation on original sequences, which struggles to capture fine-grained features in users’ historical interaction sequences. Meanwhile, these augmentation methods lack semantic consistency. Additionally, most approaches employ a single aggregation strategy for user representation, making it difficult to comprehensively characterize user preferences. To tackle these issues, we propose a Fine-Grained Contrastive Learning with Dual Aggregation approach for Sequential Recommendation (FiCoRec). Specifically, we design four tailored data augmentation methods on user embedding sequences to ensure semantic consistency and adaptability, and construct rich self-supervised signals, thereby enabling fine-grained contrastive learning. Furthermore, we design a Dual Aggregation module to capture the Tail Aggregation features and Global Aggregation features of sequences, which facilitates the comprehensive learning of users’ short-term key interests and long-term global preferences. Extensive experiments conducted on four public datasets demonstrate that FiCoRec achieves superior performance compared with existing baseline models, with up to 45.93% increase on Mean Reciprocal Rank (MRR).

  • RESBilateral Intent-Enhanced Sequential Recommendation with Embedding Perturbation-Based Contrastive Learning
    by Shanfan Zhang, Yuan Rao, Yongyi Lin, Jia Lei, Linghan Zhang and Shuo Wang

    Modeling evolving user preferences from interaction sequences remains a core problem in sequential recommendation (SR). Recent work highlights intent learning for uncovering latent user motivations. Yet, existing methods either model intents within individual sequences or treat global intent signals as auxiliary supervision, limiting the explicit use of collective behavioral patterns and causing information isolation. Meanwhile, existing contrastive learning strategies are often costly and rely on suboptimal view construction, e.g., random sequence editing or weakly controlled model perturbations. We propose BIPCL, an end-to-end Bilateral Intent-enhanced, Embedding Perturbation-based Contrastive Learning framework. BIPCL integrates collective intent priors into both sequence- and item side representations via bilateral intent enhancement. Shared intent prototypes capture collective semantics from behaviorally similar entities and inject them into representations, alleviating information isolation and improving robustness. It further induces a non-separable cross-intent interaction, providing complementary sequence–item matching signals beyond unilateral intent modeling. To construct effective contrastive views, we introduce an embedding perturbation-based paradigm that directly perturbs structural item embeddings, yielding bounded and discriminative views while preserving temporal and structural dependencies. Compatibility studies across multiple CL-based SR backbones demonstrate the effectiveness of this paradigm beyond BIPCL. Extensive experiments show that BIPCL consistently outperforms state-of-the-art baselines. All code and datasets are publicly available at https://anonymous.4open.science/r/BIPCL-8E78/.

  • RESTAGRec: Tailness-Aware Gate for Sequential Recommendation under Long-Tailed Distributions
    by Fengying Li, Jiawei Gao, Sen Li and Rongsheng Dong

    Sequential recommendation performance is persistently hindered by the long-tailed distribution of interaction data. Existing dual-view methods can alleviate this issue to some extent, but they typically rely on static fusion strategies and cannot adaptively regulate the contributions of semantic and collaborative signals at the sample level, nor can they transfer such decisions to training-time supervision. We propose TAGRec (Tailness-Aware Gated Recommendation), a unified tailness-aware framework that uses a single gate to coordinate both forward view fusion and backward supervision scheduling. Specifically, TAG estimates a contextual tailness prior from observable histories to produce a sample-level gate, T-MoV uses this gate to dynamically balance semantic and collaborative views, and ASCL preserves the semantic view as a stable anchor while adaptively strengthening asymmetric contrastive supervision on the collaborative branch. Experiments on four public benchmarks show that TAGRec consistently achieves the best or near-best performance, with especially clear gains in tail-heavy settings, while introducing only lightweight overhead and no extra online inference.

  • RESPurifying Interaction Sequences: Topology-Aware Spectral Denoising for Side-Information Integrated Sequential Recommendation
    by Yang Jiao, Chao Yang, Bin Jiang and Junhao Gao

    Side-information Integrated Sequential Recommendation (SISR) enhances preference modeling under sparse interactions by incorporating auxiliary item attributes. However, two core challenges remain. First, real interaction sequences inevitably contain noisy behaviors that distort user preference inference. Second, existing methods often fail to simultaneously preserve ID-driven transition patterns and fully exploit attribute-aware semantics. To address these challenges, we propose TSD-SR. Our approach first represents each fixed-length interaction sequence under a circular-shift topology, then applies Topology-aware Spectral Denoising, followed by a Decoupled Dual-branch Fusion module. Specifically, Topology-aware Spectral Denoising is performed on two streams: a pure ID stream and an early-fused stream that integrates item ID, attribute, and positional embeddings. This process suppresses accidental interactions and transient fluctuations prior to deep encoding, while preserving informative sequential patterns. Subsequently, a Decoupled Dual-branch Fusion module models ID-centric transition dependencies and attribute-enriched semantic context in parallel, capturing collaborative signals and side-information semantics while alleviating information invasion. Experiments on four datasets from two real-world benchmarks, namely Yelp and three domains from Amazon Reviews, demonstrate that TSD-SR consistently outperforms state-of-the-art sequential recommenders and side-information-aware baselines, while exhibiting robust performance in long-tail and noisy settings. Code: https://anonymous.4open.science/r/TSD-SR-2374

  • RESMaskPoison: Intent-Guided Poisoning Attacks on Sequential Recommendation via Masked Discrete Diffusion
    by Han Zhou, Hongxu Ma, Hui Fang, Jiayu Xu and Zhu Sun

    Sequential recommendation (SR) systems are widely deployed across modern online platforms and have been shown to be vulnerable to poisoning attacks. Such attacks inject fabricated user sequences into training data to promote target items. Existing methods achieve stealthiness by enforcing surface-level similarity to genuine data, including matching item frequencies, local transition patterns, and co-occurrence statistics. This assumption holds in idealized, homogeneous settings where user behaviors are narrow and repetitive. In real-world platforms, however, users exhibit rich and context-dependent behavioral intents. In such heterogeneous environments, surface-level mimicry fails to preserve the logical coherence of user intent, causing poisoned sequences to be detectable. We propose MaskPoison, an intent-guided poisoning framework that addresses this fundamental gap. Our method extracts intent anchors from real user sequences containing the target item. A masked discrete diffusion model then synthesizes poisoned sequences conditioned on these anchors as hard semantic constraints, ensuring alignment with the behavioral manifolds of genuine users. Extensive experiments demonstrate that MaskPoison outperforms existing attacks in both attack effectiveness and stealthiness, across homogeneous and heterogeneous recommendation scenarios alike. Our code is available at https://anonymous.4open.science/r/MaskPoison-Code-6678/.

  • RESZero-Observation User Reactivation with Gap-Driven Dimensional Gating
    by Jiandong Ding, Tianying Liu, Fuyuan Liu, Huijie Qin and Tiandeng Wu

    Sequential recommendation (SR) models excel at capturing continuous user interests, but struggle with user reactivation – scenarios where users return after prolonged absence. We formally define the Zero-Observation Reactivation problem: a user possesses rich pre-gap behavioral history, yet the platform observes strictly zero signals during a macro-gap (delta t spanning months to years), causing their interests to evolve unobserved. Through systematic evaluation on three Amazon datasets (Video Games, CDs & Vinyl, Movies & TV) using a strictly chronologically-aligned Gap-Synthesize Protocol, we reveal a consistent empirical pattern: sequence intent lifespan exhibits strict monotonic decay, culminating in a structural collapse when delta t exceeds one year, affecting all major SR paradigms equally. To address this, we propose DeltaGate, a lightweight, backbone-agnostic post-processing plugin featuring Gap-Driven Dimensional Gating. Operating on a frozen backbone, DeltaGate performs dimension-level representation routing: as delta t increases, it selectively suppresses volatile short-term dimensions while preserving stable long-term interests, falling back to a zero-initialized global prior. Counterfactual perturbation provides causal evidence that this routing is genuinely delta t-drive. On the critical >365d zone, DeltaGate recovers up to +106.1% Hit@10 using only 66K trainable parameters (<4% overhead). Systematic comparison with end-to-end retraining reveals two complementary adaptation regimes: full retraining maximizes accuracy but causes gate saturation and embedding drift. DeltaGate is the only configuration that maintains interpretable dimensional routing with 46x higher parameter efficiency and zero backbone drift.

Back to program