Sequential Recommender Systems (SRSs) predict items of interest for users based on their historical interactions. Two key popular paradigms for SRs are unidirectional Next Item Prediction (NIP) and bidirectional Masked Language Modeling (MLM). NIP performs well in recommendation tasks but is constrained by its reliance on prior information and a rigid temporal order assumption, limiting its ability to capture dynamic personalized preferences. MLM, on the other hand, enhances sequence representation and personalization by leveraging bidirectional context, but its objective is misaligned with recommendation tasks. To this end, we develop MetaSR, a meta-learning-based SR approach that ingeniously combines both paradigms into a unified framework to enhance personalized sequential recommendation. Specifically, we treat the mask prediction task in MLM as the inner-loop task (i.e., the support set), adjusting mask items dynamically to generate sequences that match individual behavioral patterns to capture personalized user preferences. In the outer loop (i.e., the query set), we adopt the NIP paradigm to directly train MetaSR toward the SR target. The joint training bridges the gap between MLM and SRs tasks, also overcoming NIP’s limitations in capturing dynamic personalized preferences. Furthermore, to improve the overall efficiency, we develop a reinforcement learning-based Adaptive Masked Sequence Selection (AMSS) mechanism, automatically selecting the optimal masking prediction tasks within the meta-learning support set to accelerate the meta-learning and achieve better personalization. Experiments on multiple public benchmark datasets show that MetaSR significantly outperforms existing SRs models. The dataset and codes are available at MetaSR .

Knowledge Tracing (KT) is a fundamental task in personalized education, aiming to predict student performance by modeling their evolving concept mastery. Recent state-of-the-art approaches adopt multi-graph architectures to capture diverse concept and behavior relations. However, such models often suffer from graph imbalance, where one graph branch dominates training, undermining the benefits of structural integration. To address this, we propose AMBER (Adaptive Meta-Balanced Ensemble Representation learning), a KT framework designed to promote balanced learning across heterogeneous graph structures. AMBER introduces an external dual-graph teacher to guide the learning of ensemble representations. As the teacher itself may encode graph imbalance bias, we further incorporate a meta-distillation strategy that adaptively adjusts the teacher using student feedback, amplifying signals beneficial to underperforming branches. In addition, an adaptive graph rebalancing strategy is introduced to balance the optimization of different graph branches in real time, preventing dominance by any single structure. Experiments on three real-world datasets show that AMBER consistently outperforms competitive baselines. By promoting balanced optimization across graphs, AMBER enables more effective integration of heterogeneous learning signals in KT, providing a robust and scalable solution for personalized education. Code is available at https://github.com/AMBER2025KT/AMBER2025CIKM.

Multimodal recommender systems (MMRec) leverage multimodal features, such as visual and textual data, to improve recommendation performance, playing a key role in platforms like online shopping and short videos. However, the large modality encoders and complex processing modules of MMRec significantly reduce its efficiency. A promising solution is compressing MMRec into an ID-based MLP model (MLPRec), which has a simpler structure and avoids complex modality handling. However, traditional knowledge distillation methods struggle to transfer knowledge effectively from MMRec to MLPRec, due to differences in their model structure and capacity. To address this, we propose a frequency-decoupled knowledge distillation framework-FDRec-to efficiently transfer knowledge from MMRec to MLPRec. By analyzing graph signals from a signal processing perspective, we propose decoupling the distillation process into low-frequency and high-frequency components, ensuring effective transmission of challenging high-frequency knowledge while preventing it from being overshadowed by monotonous low-frequency signals. To address the instability and fragmentation issues of KL divergence in traditional distillation approaches, we introduce the Wasserstein distance, which captures geometric structure and provides stable gradients. Additionally, FDRec incorporates an embedding-level contrastive learning method, further enhancing the transfer of refined knowledge from MMRec and injecting graph structure information into MLPRec for more effective distillation. Extensive experiments on four benchmark datasets and five popular MMRec models show that FDRec not only significantly reduces the computational costs and improves the inference efficiency, but also achieves comparable or even superior performance compared to MMRec. Our code is available at: https://github.com/Suehn/FDRec_

The surge in multimedia content has led to the development of Multi-Modal Recommender Systems (MMRecs), which use diverse modalities-like text, images, videos, and audio-for more personalized recommendations. However, MMRecs struggle with the challenge of noisy data from the misalignment among modal content and the difference between modal and recommendation semantics, while traditional denoising methods fall short in addressing these issues due to the complexity of multi-modal data. To overcome this, we propose a universal guided in-sync distillation denoising framework for multi-modal recommndation (GUIDER), aimed at improving MMRecs by denoising user feedbacks. Specifically, GUIDER employs a re-calibration strategy to identify clean and noisy interactions from modal content. Furthermore, it incorporates a Denoising Bayesian Personalized Ranking (DBPR) loss function to denoise implicit user feedback. Finally, it utilizes a denoising knowledge distillation objective based on Optimal Transport (OT) distance to guide the mapping from modality representations to recommendation semantics spaces. GUIDER can be seamlessly integrated into existing MMRecs methods as a plug-and-play solution for recommendation denoising. Experiment results on four public datasets show its effectiveness and universality across various MMRecs.

Multi-modal recommender systems (MMRecs) leverage diverse modalities to deliver personalized recommendations, yet they often struggle with efficiency due to the large size of modality encoders and the complexity of fusing high-dimensional features. To address the efficiency issue, a promising solution is to compress a cumbersome MMRec into a lightweight ID-based Multi- Layer Perceptron-based Recommender system (MLPRec) through Knowledge Distillation (KD). Despite effectiveness, we argue that this approach overlooks the significant gap between the complex teacher MMRec and the lightweight, ID-based student MLPRec, which differ significantly in size, architecture, and input modalities, leading to ineffective knowledge transfer and suboptimal student performance. To bridge this gap, we propose TARec, a novel teacher-assisted Wasserstein Knowledge Distillation framework for compressing MMRecs into an efficient MLPRec. TARec introduces: (i) a two-staged KD process using an intermediate Teacher Assistant (TA) model to bridge the gap between teacher and student, facilitating smoother knowledge transfer; (ii) logit-level KD using the Wasserstein Distance as metric, replacing the conventional KL divergence to ensure stable gradient flow even with significant teacher-student gaps; and (iii) embedding-level contrastive KD to further distill high-quality embedding-level knowledge from teacher. Extensive experiments on real-world datasets verify the effectiveness of TARec, demonstrating that TARec significantly outperforms the state-of-the-art MMRecs while reducing computational costs. Our code is available at: https://github.com/Suehn/TARec.git.

Multimodal foundation models (MFMs) have revolutionized sequential recommender systems through advanced representation learning. While Parameter-efficient Fine-tuning (PEFT) is commonly used to adapt these models, studies often prioritize parameter efficiency, neglecting GPU memory and training speed. To address this, we introduced the IISAN framework, significantly enhancing efficiency. However, IISAN was limited to symmetrical MFMs and identical text and image encoders, preventing the use of state-of-the-art Large Language Models. To overcome this, we developed IISAN-Versa, a versatile plug-and-play architecture compatible with both symmetrical and asymmetrical MFMs. IISAN-Versa employs a Decoupled PEFT structure and utilizes both intra- and inter-modal adaptation. It effectively handles asymmetry through a simple yet effective combination of group layer-dropping and dimension transformation alignment. Our research demonstrates that IISAN-Versa effectively adapts large text encoders, and we further identify a scaling effect where larger text encoders generally perform better. IISAN-Versa also demonstrates strong versatility in our defined multimodal scenarios, which include raw titles and captions generated from images and videos. Additionally, IISAN-Versa achieved state-of-the-art performance on the MicroLens public benchmark.

Recently, multimodal recommendations (MMRs) have gained increasing attention for alleviating the data sparsity problem of traditional recommender systems by incorporating modality-based representations. Although MMR exhibits notable improvement in recommendation accuracy, we empirically validate that an increase in the quantity or variety of modalities leads to a higher degree of users’ sensitive information leakage due to entangled causal relationships, risking fair representation learning. On the other hand, existing fair representation learning approaches are mostly based on the assumption that sensitive information is solely leaked from users’ interaction data and do not explicitly model the causal relationships introduced by multimodal data, which limits their applicability in multimodal scenarios. To address this limitation, we propose a novel fair multimodal recommendation approach (dubbed FMMRec) through causality-inspired fairness-oriented modal disentanglement and relation-aware fairness learning. Particularly, we disentangle biased and filtered modal embeddings inspired by causal inference techniques, enabling the mining of modality-based unfair and fair user–user relations, thereby enhancing the fairness and informativeness of user representations. By addressing the causal effects of sensitive attributes on user preferences, our approach aims to achieve counterfactual fairness in MMRs. Experiments on two public datasets demonstrate the superiority of our FMMRec relative to the state-of-the-art baselines. Our source code is available at https://github.com/WeixinChen98/FMMRec .

ID-based Recommender Systems (RecSys), where each item is assigned a unique identifier and subsequently converted into an embedding vector, have dominated the de-signing of RecSys. Though prevalent, such ID-based paradigm is not suitable for developing transferable RecSys and is also susceptible to the cold -start issue. In this paper, we unleash the boundaries of the ID- based paradigm and propose a Pure Multi-Modality based Recommender system (PMMRec), which relies solely on the multi-modal contents of the items (e.g., texts and images) and learns transition patterns general enough to transfer across domains and platforms. Specifically, we design a plug-and-play framework architecture consisting of multi-modal item encoders, a fusion module, and a user encoder. To align the cross-modal item representations, we propose a novel next-item enhanced cross-modal contrastive learning objective, which is equipped with both inter- and intra-modality negative samples and explicitly incorporates the transition patterns of user behaviors into the item encoders. To ensure the robustness of user representations, we propose a novel noised item detection objective and a robustness-aware contrastive learning objective, which work together to denoise user sequences in a self-supervised manner. PMMRec is designed to be loosely coupled, so after being pre-trained on the source data, each component can be transferred alone, or in conjunction with other components, allowing PMMRec to achieve versatility under both multi-modality and single-modality transfer learning settings. Extensive experiments on 4 sources and 10 target datasets demonstrate that PMMRec surpasses the state-of-the-art recommenders in both recommendation performance and transferability. Our code and dataset is available at: https://github.com/ICDE24IPMMRec.

The advent of large language models has inspired active and promising research focused on developing text content-based recommendation models. Meanwhile, although image features are also key signals in recommender systems, there is currently a lack of research on recommendation models that are primarily based on raw image pixels. The lack of large-scale datasets containing raw images in visually driven recommendation scenarios has been a significant barrier to the development of this research direction. To address this challenge, we introduce PixelRec, a comprehensive dataset of cover images collected from a video streaming platform. With approximately 200 million user image interactions, 30 million users, and 400,000 high-resolution short video cover images, PixelRec facilitates the development, benchmarking, and analysis of various image pixel based recommendation models. Leveraging this dataset, we establish a accessible pipeline to implement a series of vision-based recommendation models, providing extensive benchmark results for them. Our contributions include the PixelRec dataset, baseline algorithms, operational pipeline, exploratory findings, and the PixelRec benchmark. We believe PixelRec will significantly advance research on recommendation models based on image content and foster fruitful collaboration between the fields of recommender systems and computer vision. The dataset, code, and documents are made available at https://github.com/westlake-repl/PixelRec.

Recommendation models that utilize unique identities (IDs for short) to represent distinct users and items have been state-of-the-art (SOTA) and dominated the recommender systems (RS) literature for over a decade. Meanwhile, the pre-trained modality encoders, such as BERT [9] and Vision Transformer [11], have become increasingly powerful in modeling the raw modality features of an item, such as text and images. Given this, a natural question arises: can a purely modality-based recommendation model (MoRec) outperforms or matches a pure ID-based model (IDRec) by replacing the itemID embedding with a SOTA modality encoder? In fact, this question was answered ten years ago when IDRec beats MoRec by a strong margin in both recommendation accuracy and efficiency.

Heterogeneous sequential recommendation (HSR) is a very important recommendation problem, which aims to predict a user’s next interacted item under a target behavior type (e.g., purchase in e-commerce sites) based on his/her historical interactions with different behaviors. Though existing sequential methods have achieved advanced performance by considering the varied impacts of interactions with sequential information, a large body of them still have two major shortcomings. Firstly, they usually model different behaviors separately without considering the correlations between them. The transitions from item to item under diverse behaviors indicate some users’ potential behavior manner. Secondly, though the behavior information contains a user’s fine-grained interests, the insufficient consideration of the local context information limits them from well understanding user intentions. Utilizing the adjacent interactions to better understand a user’s behavior could improve the certainty of prediction. To address these two issues, we propose a novel solution utilizing global and personalized graphs for HSR (GPG4HSR) to learn behavior transitions and user intentions. Specifically, our GPG4HSR consists of two graphs, i.e., a global graph to capture the transitions between different behaviors, and a personalized graph to model items with behaviors by further considering the distinct user intentions of the adjacent contextually relevant nodes. Extensive experiments on four public datasets with the state-of-the-art baselines demonstrate the effectiveness and general applicability of our method GPG4HSR.