Kaize Ding

Dr. Kaize Ding


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
1 January 2024
Verified
Conference Paper
Open access
PDF file
XMXiaoxiao Ma
Xiaoxiao Ma
YZYuchen Zhang
Yuchen Zhang
KDKaize Ding
Kaize Ding
JYJian Yang
Jian Yang
Jia WUJia WU
Jia WU
HFHong Fan
Hong Fan
Xiaoxiao Ma, Yuchen Zhang, Kaize Ding, Jian Yang, Jia Wu, Hao Fan. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.

1 January 2025
Verified
Conference Paper
Open access
PDF file
RXRuiyao Xu
Ruiyao Xu
KDKaize Ding
Kaize Ding
Ruiyao Xu, Kaize Ding. Findings of the Association for Computational Linguistics: NAACL 2025. 2025.

1 January 2025
Verified
Conference Paper
Open access
PDF file
TYTiankai Yang
Tiankai Yang
YNYi Nian
Yi Nian
LLLi Li
Li Li
RXRuiyao Xu
Ruiyao Xu
Yuangang LIYuangang LI
Yuangang LI
YZYue Zhao
Yue Zhao
Tiankai Yang, Yi Nian, Li Li, Ruiyao Xu, Yuangang Li, Jiaqi Li, Zhuo Xiao, Xiyang Hu, Ryan A. Rossi, Kaize Ding, Xia Hu, Yue Zhao. Findings of the Association for Computational Linguistics: ACL 2025. 2025.

1 January 2024
Verified
Conference Paper
Open access
PDF file
YLYichuan Li
Yichuan Li
KDKaize Ding
Kaize Ding
JWJianling Wang
Jianling Wang
KLKyumin Lee
Kyumin Lee
Yichuan Li, Kaize Ding, Jianling Wang, Kyumin Lee. Findings of the Association for Computational Linguistics ACL 2024. 2024.

1 January 2023
Verified
Conference Paper
Open access
PDF file
YLYichuan Li
Yichuan Li
KDKaize Ding
Kaize Ding
KLKyumin Lee
Kyumin Lee
Yichuan Li, Kaize Ding, Kyumin Lee. Findings of the Association for Computational Linguistics: EMNLP 2023. 2023.

24 March 2024 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
BJBaoyu Jing
Baoyu Jing
YYYuchen Yan
Yuchen Yan
KDKaize Ding
Kaize Ding
CPChanyoung Park
Chanyoung Park
YZYada Zhu
Yada Zhu
HTHanghang Tong
Hanghang Tong
A fundamental challenge of bipartite graph representation learning is how to extract informative node embeddings. Self-Supervised Learning (SSL) is a promising paradigm to address this challenge. Most recent bipartite graph SSL methods are based on contrastive learning which learns embeddings by discriminating positive and negative node pairs. Contrastive learning usually requires a large number of negative node pairs, which could lead to computational burden and semantic errors. In this paper, we introduce a novel synergistic representation learning model (STERLING) to learn node embeddings without negative node pairs. STERLING preserves the unique local and global synergies in bipartite graphs. The local synergies are captured by maximizing the similarity of the inter-type and intra-type positive node pairs, and the global synergies are captured by maximizing the mutual information of co-clusters. Theoretical analysis demonstrates that STERLING could improve the connectivity between different node types in the embedding space. Extensive empirical evaluation on various benchmark datasets and tasks demonstrates the effectiveness of STERLING for extracting node embeddings.