Yongxin Ni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yongxin Ni has a total of 65 co-authors. Here are the top co-authors by number of shared publications:
- Youhua Li
City University of Hong Kong, Hong Kong, China
9 shared publications - Junchen Fu
University of Glasgow, Glasgow, United Kingdom
8 shared publications - Ersheng Ni
The University of Queensland, Brisbane, Australia
3 shared publications - Fajie Yuan
School of Engineering, Westlake University, Hangzhou, China
3 shared publications - Hanwen Du
The Ohio State University, Columbus, USA
3 shared publications - Joemon M. Jose
University of Glasgow, Glasgow, United Kingdom
3 shared publications
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 437-446
RecRec: Latent Interests Recursive Reasoning for Sequential Recommendation
Sequential recommender systems rely on a single forward pass to encode user interaction histories and predict the next item. Increasing inference-time computation through latent reasoning, with the model proceeding step by step before the final prediction, has been recently explored in sequential recommendation with promising results. However, how to structure the reasoning process for sequential recommendation remains an open question. Existing approaches couple reasoning and prediction in a single d-dimensional state, limiting reasoning depth and often relying on multi-stage pipelines with reinforcement learning (RL). We propose RecRec (Recursive Reasoning for Recommendation), an RL-free framework that decouples reasoning from prediction, overcoming the fixed d-dimensional state bottleneck of prior methods. RecRec consists of a Context Compressor and a Recursive Reasoner, trained in two simple supervised stages. The Context Compressor distills the backbone’s hidden states into a small set of latent interests, with an Interest Diversity Regularizer encouraging each interest to capture a distinct aspect of user behavior. The Recursive Reasoner then refines these interests by reasoning in a separate intermediate latent space. Deep supervision lets the reasoning depth be freely adjusted at inference without retraining. On four real-world datasets, RecRec outperforms state-of-the-art reasoning-enhanced methods, and on three of four datasets, gains extend past the training-time depth. Our findings point to a decoupled, multi-vector recipe that unleashes latent reasoning from the single-state bottleneck of prior methods, suggesting reasoning-state structure as a design axis to explore further in sequential recommendation.
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 437-446
Open AccessRecRec: Latent Interests Recursive Reasoning for Sequential Recommendation
Sequential recommender systems rely on a single forward pass to encode user interaction histories and predict the next item. Increasing inference-time computation through latent reasoning, with the model proceeding step by step before the final prediction, has been recently explored in sequential recommendation with promising results. However, how to structure the reasoning process for sequential recommendation remains an open question. Existing approaches couple reasoning and prediction in a single d-dimensional state, limiting reasoning depth and often relying on multi-stage pipelines with reinforcement learning (RL). We propose RecRec (Recursive Reasoning for Recommendation), an RL-free framework that decouples reasoning from prediction, overcoming the fixed d-dimensional state bottleneck of prior methods. RecRec consists of a Context Compressor and a Recursive Reasoner, trained in two simple supervised stages. The Context Compressor distills the backbone’s hidden states into a small set of latent interests, with an Interest Diversity Regularizer encouraging each interest to capture a distinct aspect of user behavior. The Recursive Reasoner then refines these interests by reasoning in a separate intermediate latent space. Deep supervision lets the reasoning depth be freely adjusted at inference without retraining. On four real-world datasets, RecRec outperforms state-of-the-art reasoning-enhanced methods, and on three of four datasets, gains extend past the training-time depth. Our findings point to a decoupled, multi-vector recipe that unleashes latent reasoning from the single-state bottleneck of prior methods, suggesting reasoning-state structure as a design axis to explore further in sequential recommendation.
- 27 April 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 344
Interpretable knowledge tracing via explicit–implicit alignment
- 27 April 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 344
Interpretable knowledge tracing via explicit–implicit alignment
- Open Access
- 2 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (2) , 1-19
Bridging NIP and MLM: A Unified Meta-Learning Framework for Sequential Recommendation
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 .
- 2 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 20 (2) , 1-19
Open AccessBridging NIP and MLM: A Unified Meta-Learning Framework for Sequential Recommendation
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 .
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4571-4581
Frequency-Decoupled Distillation for Efficient Multimodal Recommendation
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 4571-4581
Open AccessFrequency-Decoupled Distillation for Efficient Multimodal Recommendation
- Top Cited PapersOpen Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6486-6491
A Content-Driven Micro-Video Recommendation Dataset at Scale
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6486-6491
Top Cited PapersOpen AccessA Content-Driven Micro-Video Recommendation Dataset at Scale
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2801-2810
AMBER: Adaptive Meta Balanced Paradigm for Heterogeneous Graph-Based Knowledge Tracing
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 2801-2810
Open AccessAMBER: Adaptive Meta Balanced Paradigm for Heterogeneous Graph-Based Knowledge Tracing
- Open Access
- 10 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (6) , 1-29
Causality-Inspired Fair Representation Learning for Multimodal Recommendation
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 .
- 10 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 43 (6) , 1-29
Open AccessCausality-Inspired Fair Representation Learning for Multimodal Recommendation
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 .
- Open Access
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 2464-2475
Bridging the Gap: Teacher-Assisted Wasserstein Knowledge Distillation for Efficient Multi-Modal Recommendation
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 2464-2475
Open AccessBridging the Gap: Teacher-Assisted Wasserstein Knowledge Distillation for Efficient Multi-Modal Recommendation
- Open Access
- 10 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 782-791
Teach Me How to Denoise: A Universal Framework for Denoising Multi-modal Recommender Systems via Guided Calibration
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.
- 10 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 782-791
Open AccessTeach Me How to Denoise: A Universal Framework for Denoising Multi-modal Recommender Systems via Guided Calibration
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.
- Top Cited Papers
- 6 July 2024
- Published by Elsevier in Neurocomputing
- Vol. 600
A comprehensive review of community detection in graphs
- 6 July 2024
- Published by Elsevier in Neurocomputing
- Vol. 600
Top Cited PapersA comprehensive review of community detection in graphs