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

Ke Fei

dblp:400/5777 · DBLP profile ↗
in reviewer pool ← Back
4ranked-venue papers
4as first author
4since 2021 · last 2026
0009-0000-6249-6855ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
3 papers
Recommender systems · 100%
Artificial intelligence
2 papers
Efficient and distributed learning · 74% Trustworthy machine learning · 26%

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

TopicWeightPapersLastEvidence papers
Recommender systems
cross-domain recommendation
2.022026
Sharpness-Consistent Cross-Domain Recommendation for Cold-Start Items · WWW 2026
Stable and Adaptive Fusion for Multi-domain Multi-task Recommendation · AAAI 2026
Recommender systems
cold-start recommendation
1.012026
Sharpness-Consistent Cross-Domain Recommendation for Cold-Start Items · WWW 2026
Recommender systems › generative recommendation
semantic ID
1.012026
Sharpness-Consistent Cross-Domain Recommendation for Cold-Start Items · WWW 2026
Machine learning › Efficient and distributed learning › model compression
knowledge distillation
0.912025
Entire-Space Variational Information Exploitation for Post-Click Conversion Rate Prediction · AAAI 2025
Recommender systems
conversion rate prediction
0.912025
Entire-Space Variational Information Exploitation for Post-Click Conversion Rate Prediction · AAAI 2025
Machine learning › Trustworthy machine learning › robustness › spurious correlation
spurious correlation mitigation
0.312026
Stable and Adaptive Fusion for Multi-domain Multi-task Recommendation · AAAI 2026
Recommender systems › debiased recommendation
selection bias
0.312025
Entire-Space Variational Information Exploitation for Post-Click Conversion Rate Prediction · AAAI 2025

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

random fourier features · 2.0hilbert-schmidt independence criterion · 2.0adaptive gating · 2.0variational information exploitation · 1.7teacher-student framework · 1.7logit distillation · 1.7sharpness-aware minimization · 1.0semantic ID embedding · 1.0loss landscape consistency · 1.0
YearPublicationVenuePosition
2026 Stable and Adaptive Fusion for Multi-domain Multi-task Recommendation
abstract
Multi-Domain Multi-Task (MDMT) recommendation aims to provide personalized recommendations by leveraging information across multiple domains and tasks. However, existing methods often suffer from spurious correlations between irrelevant features and the target, leading to negative transfer. To address this, we propose a Stable and Adaptive Fusion (SAF) framework for MDMT recommendation. SAF introduces a weighted Hilbert-Schmidt Independence Criterion (HSIC) loss to decorrelate irrelevant features from the target, learning sample weights that promote stable (i.e., robust to spurious correlations) representations in both bottom and expert layers. We employ Random Fourier Features (RFF) to enable scalable computation of the HSIC loss. We further employ adaptive feature and expert gating to select these stable features, enabling the model to capture intricate cross-domain and cross-task dependencies. The learned sample weights are also used to reweight the MDMT loss during training. Experiments on large-scale datasets show that SAF outperforms state-of-the-art baselines by up to 2% in AUC. To facilitate further research, we release a new industrial dataset with 30 million interactions across 3 domains and 2 tasks, with 300 features.
Ke Fei, Kangyi Lin, Zibin Zhang, Jingjing Li 0001
AAAI1
2026 Sharpness-Consistent Cross-Domain Recommendation for Cold-Start Items
abstract
Cold-start remains a fundamental challenge in recommendation systems due to the scarcity of interaction data. Recent methods address this issue by leveraging semantic ID embeddings and cross-domain transfer techniques, achieving notable progress. However, the common practice of learning semantic ID embeddings and training the recommendation model in separate stages hinders the generalization capability of semantic IDs throughout the training process. In this work, we propose Sharpness-Consistent Cross-Domain Recommendation (SC2 Rec), a novel framework designed to enhance the generalization of semantic ID-based models in cold-start scenarios. SC2 Rec alternately optimizes the sharpness of the loss landscape and enforces landscape consistency between warm and cold domains, leading to unified and flatter minima and improved generalization. Extensive experiments on industrial datasets demonstrate the effectiveness of SC2 Rec. Furthermore, we release a high-quality dataset to facilitate further research in this area.
Ke Fei, Jingjing Li 0001, Zhekai Du
WWW1
2026 Inverse Contrastive Representation Learning for Post-Click Conversion Rate Estimation
abstract
In recommender systems, accurate post-click conversion rate (CVR) estimation is crucial for a company’s revenue growth. Currently, multi-task causal methods—such as multi-task doubly robust learning—improve CVR estimation by reducing bias and variance during training. However, these methods often overlook the impact of hard-to-classify samples, which deviate significantly from the sample cluster center and substantially increase the bias and variance of multi-task causal approaches. To address this limitation, we propose a novel inverse contrastive representation learning guided causal multi-task framework. Specifically, we first select clicked and unclicked samples that deviate significantly from their respective cluster centers to form negative pairs. We then apply inverse contrastive representation learning (ICRL) to pull these negative pairs closer together, encouraging deviated clicked samples to move closer to the clicked cluster center, and vice versa. This approach yields a more accurate and lower-variance inverse propensity score for the CVR estimator. Additionally, we compute the ICRL loss segmentally to reduce computational resource consumption. We conduct extensive experiments on six large-scale datasets, as well as online A/B tests on our advertising platform. Our method achieves a 2.9% improvement on offline datasets compared to state-of-the-art baselines, and a 0.6% increase over the online production model.
Ke Fei, Jingjing Li 0001, Tianxu Ji, Wei Wang 0366, Hongkai Qi
ACM Trans. Inf. Syst.1
2025 Entire-Space Variational Information Exploitation for Post-Click Conversion Rate Prediction
abstract
In recommender systems, post-click conversion rate (CVR) estimation is an essential task to model user preferences for items and estimate the value of recommendations. Sample selection bias (SSB) and data sparsity (DS) are two persistent challenges for post-click conversion rate (CVR) estimation. Currently, entire-space approaches that exploit unclicked samples through knowledge distillation are promising to mitigate SSB and DS simultaneously. Existing methods use non-conversion, conversion, or adaptive conversion predictors to generate pseudo labels for unclicked samples. However, they fail to consider the unbiasedness and information limitations of these pseudo labels. Motivated by such analysis, we propose an entire-space variational information exploitation framework (EVI) for CVR prediction. First, EVI uses a conditional entire-space CVR teacher to generate unbiased pseudo labels. Then, it applies variational information exploitation and logit distillation to transfer non-click space information to the target CVR estimator. We conduct extensive offline experiments on six large-scale datasets. EVI demonstrated a 2.25% average improvement compared to the state-of-the-art baselines.
Ke Fei, Jingjing Li 0001
AAAI1