Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhibo Cai

dblp:342/1685 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0009-0007-3582-8835ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 100%
Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 50% Representation and self-supervised learning · 50%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › representation learning for recommendation
item representation learning
0.912025
AlphaFuse: Learn ID Embeddings for Sequential Recommendation in Null Space of Language Embeddings · SIGIR 2025
Recommender systems
sequential recommendation
0.912025
AlphaFuse: Learn ID Embeddings for Sequential Recommendation in Null Space of Language Embeddings · SIGIR 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.712023
Boosting Causal Discovery via Adaptive Sample Reweighting · ICLR 2023
Machine learning › Representation and self-supervised learning
contrastive learning
0.712023
Empowering Collaborative Filtering with Principled Adversarial Contrastive Loss · NeurIPS 2023
Recommender systems
collaborative filtering
0.712023
Empowering Collaborative Filtering with Principled Adversarial Contrastive Loss · NeurIPS 2023
Recommender systems › representation learning for recommendation
contrastive learning for recommendation
0.712023
Empowering Collaborative Filtering with Principled Adversarial Contrastive Loss · NeurIPS 2023

Methods — techniques the papers use, named apart from their topics

hardness-aware ranking · 1.3adversarial hardness assignment · 1.3InfoNCE · 1.3singular value decomposition · 0.9large language model · 0.9diffusion model · 0.9adaptive sample reweighting · 0.7
YearPublicationVenuePosition
2025 AlphaFuse: Learn ID Embeddings for Sequential Recommendation in Null Space of Language Embeddings
abstract
Recent advancements in sequential recommendation have underscored the potential of Large Language Models (LLMs) for enhancing item embeddings. However, existing approaches face three key limitations: 1) the degradation of the semantic space when high-dimensional language embeddings are mapped to lower-dimensional ID embeddings, 2) the underutilization of language embeddings, and 3) the reliance on additional trainable parameters, such as an adapter, to bridge the gap between the semantic and behavior spaces. In this paper, we introduce AlphaFuse, a simple but effective language-guided learning strategy that addresses these challenges by learning ID embeddings within the null space of language embeddings. Specifically, we decompose the semantic space of language embeddings via Singular Value Decomposition (SVD), distinguishing it into a semantic-rich row space and a semantic-sparse null space. Collaborative signals are then injected into the null space, while preserving the rich semantics of the row space. AlphaFuse prevents degradation of the semantic space, integrates the retained language embeddings into the final item embeddings, and eliminates the need for auxiliary trainable modules, enabling seamless adaptation to any sequential recommendation framework. We validate the effectiveness and flexibility of AlphaFuse through extensive experiments on three benchmark datasets, including cold-start user and long-tail settings, showcasing significant improvements in both discriminative and diffusion-based generative sequential recommenders.
Guoqing Hu, An Zhang 0003, Shuo Liu 0017, Zhibo Cai, Xun Yang 0001, Xiang Wang 0010
SIGIR4
2023 Boosting Causal Discovery via Adaptive Sample Reweighting
An Zhang 0003, Fangfu Liu, Wenchang Ma, Zhibo Cai, Xiang Wang 0010, Tat-Seng Chua
ICLR4
2023 Empowering Collaborative Filtering with Principled Adversarial Contrastive Loss
abstract
Contrastive Learning (CL) has achieved impressive performance in self-supervised learning tasks, showing superior generalization ability. Inspired by the success, adopting CL into collaborative filtering (CF) is prevailing in semi-supervised topK recommendations. The basic idea is to routinely conduct heuristic-based data augmentation and apply contrastive losses (e.g., InfoNCE) on the augmented views. Yet, some CF-tailored challenges make this adoption suboptimal, such as the issue of out-of-distribution, the risk of false negatives, and the nature of top-K evaluation. They necessitate the CL-based CF scheme to focus more on mining hard negatives and distinguishing false negatives from the vast unlabeled user-item interactions, for informative contrast signals. Worse still, there is limited understanding of contrastive loss in CF methods, especially w.r.t. its generalization ability. To bridge the gap, we delve into the reasons underpinning the success of contrastive loss in CF, and propose a principled Adversarial InfoNCE loss (AdvInfoNCE), which is a variant of InfoNCE, specially tailored for CF methods. AdvInfoNCE adaptively explores and assigns hardness to each negative instance in an adversarial fashion and further utilizes a fine-grained hardness-aware ranking criterion to empower the recommender’s generalization ability. Training CF models with AdvInfoNCE, we validate the effectiveness of AdvInfoNCE on both synthetic and real-world benchmark datasets, thus showing its generalization ability to mitigate out-of-distribution problems. Given the theoretical guarantees and empirical superiority of AdvInfoNCE over most contrastive loss functions, we advocate its adoption as a standard loss in recommender systems, particularly for the out-of-distribution tasks. Codes are available at https://github.com/LehengTHU/AdvInfoNCE.
An Zhang 0003, Leheng Sheng, Zhibo Cai, Xiang Wang 0010, Tat-Seng Chua
NeurIPS3