Kexin Zhang

Kexin Zhang

Auto-generated profile, based on publicly available information

Kexin Zhang

Northwestern University, Evanston, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 July 2025
Verified
Conference Paper
Open access
CZChenhao Zhai
Chenhao Zhai
CMChang Meng
Chang Meng
YYYu Yang
Yu Yang
KZKexin Zhang
Kexin Zhang
XZXuhao Zhao
Xuhao Zhao
XLXiu Li
Xiu Li

5 February 2026 in ACM Transactions on Knowledge Discovery From Data
Verified
Journal Article
Open access
KZKexin Zhang
Kexin Zhang
SLShuhan Liu
Shuhan Liu
SWSong Wang
Song Wang
WSWeili Shi
Weili Shi
CCChen Chen
Chen Chen
KDKaize Ding
Kaize Ding
Distribution shifts on graphs—the discrepancies in data distribution between training and employing a graph machine learning model—are ubiquitous and often unavoidable in real-world applications. These shifts may severely deteriorate model performance, posing significant challenges for reliable graph machine learning. In recent years, there has been a surge in research on graph machine learning specifically designed to tackle such distribution shifts, aiming to train models to achieve satisfactory performance on Out-of-Distribution (OOD) test data. This survey provides an up-to-date and forward-looking review of deep graph learning under distribution shifts. We categorize the field into three primary scenarios: graph OOD generalization, training-time graph OOD adaptation, and test-time graph OOD adaptation. We begin by formally formulating the problems and discussing various types of distribution shifts that can affect graph learning, such as covariate shifts and concept shifts. To provide a structured understanding of the literature, we introduce a systematic taxonomy that classifies existing methods into model-centric and data-centric approaches, investigating the techniques used in each category. We also summarize commonly used datasets in this research area to facilitate further investigation. Finally, we point out promising research directions and the corresponding challenges to encourage further study in this vital domain. Additionally, we provide a continuously updated reading list at https://github.com/kaize0409/Awesome-Graph-OOD .

4 March 2024
Verified
Conference Paper
Open access
KZKexin Zhang
Kexin Zhang
YWYichao Wang
Yichao Wang
XLXiu Li
Xiu Li
RTRuiming Tang
Ruiming Tang
RZRui Zhang
Rui Zhang
For better performance and less resource consumption, multi-scenario recommendation (MSR) is proposed to train a unified model to serve all scenarios by leveraging data from multiple scenarios. Current works in MSR focus on designing effective networks for better information transfer among different scenarios. However, they omit two important issues when applying MSR models in industrial situations. The first is the efficiency problem brought by mixed data, which delays the update of models and further leads to performance degradation. The second is that MSR models are insensitive to the changes of distribution over time, resulting in suboptimal effectiveness in the incoming data. In this paper, we propose an incremental learning approach for MSR (IncMSR), which can not only improve the training efficiency but also perceive changes in distribution over time. Specifically, we first quantify the pair-wise distance between representations from scenario, time and time-scenario dimensions respectively. Then, we decompose the MSR model into scenario-shared and scenario-specific parts and apply fine-grained constraints on the distances quantified with respect to the two different parts. Finally, all constraints are fused in an elegant way using a metric learning framework as a supplementary penalty term to the original MSR loss function. Offline experiments on two real-world datasets are conducted to demonstrate the superiority and compatibility of our proposed approach.

10 March 2025
Verified
Conference Paper
Open access
KZKexin Zhang
Kexin Zhang
FLFuyuan Lyu
Fuyuan Lyu
XTXing Tang
Xing Tang
DLDugang Liu
Dugang Liu
CMChen Ma
Chen Ma
XLXue Liu
Xue Liu
The evolution of previous Click-Through Rate (CTR) models has mainly been driven by proposing complex components, whether shallow or deep, that are adept at modeling feature interactions. However, there has been less focus on improving fusion design. Instead, two naive solutions, stacked and parallel fusion, are commonly used. Both solutions rely on pre-determined fusion connections and fixed fusion operations. It has been repetitively observed that changes in fusion design may result in different performances, highlighting the critical role that fusion plays in CTR models. While there have been attempts to refine these basic fusion strategies, these efforts have often been constrained to specific settings or dependent on specific components. Neural architecture search has also been introduced to partially deal with fusion design, but it comes with limitations. The complexity of the search space can lead to inefficient and ineffective results. To bridge this gap, we introduce OptFusion, a method that automates the learning of fusion, encompassing both the connection learning and the operation selection. We have proposed a one-shot learning algorithm tackling these tasks concurrently. Our experiments are conducted over three large-scale datasets. Extensive experiments prove both the effectiveness and efficiency of OptFusion in improving CTR model performance. Our code implementation is available here https://github.com/kexin-kxzhang/OptFusion.


8 August 2026
Verified
Conference Paper
Open access
YZYaotian Zhu
Yaotian Zhu
RXRuiyao Xu
Ruiyao Xu
ZGZhaoyang Guan
Zhaoyang Guan
KZKexin Zhang
Kexin Zhang
NRNoah Rudko
Noah Rudko
KDKaize Ding
Kaize Ding