Sitao Luan

Dr. Sitao Luan


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
20 February 2024
Verified
Book Chapter
Closed access
PDF file
SLSitao Luan
Sitao Luan
CHChenqing Hua
Chenqing Hua
QLQincheng Lu
Qincheng Lu
JZJiaqi Zhu
Jiaqi Zhu
XCXiao-Wen Chang
Xiao-Wen Chang
DPDoina Precup
Doina Precup


6 February 2024 in arXiv
Verified
Preprint
Open access
PDF file
CHChenqing Hua
Chenqing Hua
SLSitao Luan
Sitao Luan
MXMinkai Xu
Minkai Xu
RYRex Ying
Rex Ying
JFJie Fu
Jie Fu
DPDoina Precup
Doina Precup
Molecule generation is a very important practical problem, with uses in drug discovery and material design, and AI methods promise to provide useful solutions. However, existing methods for molecule generation focus either on 2D graph structure or on 3D geometric structure, which is not sufficient to represent a complete molecule as 2D graph captures mainly topology while 3D geometry captures mainly spatial atom arrangements. Combining these representations is essential to better represent a molecule. In this paper, we present a new model for generating a comprehensive representation of molecules, including atom features, 2D discrete molecule structures, and 3D continuous molecule coordinates, by combining discrete and continuous diffusion processes. The use of diffusion processes allows for capturing the probabilistic nature of molecular processes and exploring the effect of different factors on molecular structures. Additionally, we propose a novel graph transformer architecture to denoise the diffusion process. The transformer adheres to 3D roto-translation equivariance constraints, allowing it to learn invariant atom and edge representations while preserving the equivariance of atom coordinates. This transformer can be used to learn molecular representations robust to geometric transformations. We evaluate the performance of our model through experiments and comparisons with existing methods, showing its ability to generate more stable and valid molecules. Our model is a promising approach for designing stable and diverse molecules and can be applied to a wide range of tasks in molecular modeling.

4 July 2023 in Preprints.org
Verified
Preprint
Open access
PDF file
SLSitao Luan
Sitao Luan
This report gives a comprehensive summary of two problems about graph convolutional networks (GCNs): over-smoothing and heterophily challenges, and outlines future directions to explore.

12 July 2024 in arXiv
Verified
Preprint
Open access
PDF file
SLSitao Luan
Sitao Luan
CHChenqing Hua
Chenqing Hua
QLQincheng Lu
Qincheng Lu
LMLiheng Ma
Liheng Ma
LWLirong Wu
Lirong Wu
SJStefanie Jegelka
Stefanie Jegelka
Homophily principle, \ie{} nodes with the same labels or similar attributes are more likely to be connected, has been commonly believed to be the main reason for the superiority of Graph Neural Networks (GNNs) over traditional Neural Networks (NNs) on graph-structured data, especially on node-level tasks. However, recent work has identified a non-trivial set of datasets where GNN's performance compared to the NN's is not satisfactory. Heterophily, i.e. low homophily, has been considered the main cause of this empirical observation. People have begun to revisit and re-evaluate most existing graph models, including graph transformer and its variants, in the heterophily scenario across various kinds of graphs, e.g. heterogeneous graphs, temporal graphs and hypergraphs. Moreover, numerous graph-related applications are found to be closely related to the heterophily problem. In the past few years, considerable effort has been devoted to studying and addressing the heterophily issue. In this survey, we provide a comprehensive review of the latest progress on heterophilic graph learning, including an extensive summary of benchmark datasets and evaluation of homophily metrics on synthetic graphs, meticulous classification of the most updated supervised and unsupervised learning methods, thorough digestion of the theoretical analysis on homophily/heterophily, and broad exploration of the heterophily-related applications. Notably, through detailed experiments, we are the first to categorize benchmark heterophilic datasets into three sub-categories: malignant, benign and ambiguous heterophily. Malignant and ambiguous datasets are identified as the real challenging datasets to test the effectiveness of new models on the heterophily challenge. Finally, we propose several challenges and future directions for heterophilic graph representation learning.

1 January 2025
Verified
Conference Paper
Open access
PDF file
YZYilun Zheng
Yilun Zheng
SLSha Li
Sha Li
FWFangkun Wu
Fangkun Wu
YZYang Ziyi
Yang Ziyi
LHLin Hongchao
Lin Hongchao
LCLihui Chen
Lihui Chen
Yilun Zheng, Sha Li, Fangkun Wu, Yang Ziyi, Lin Hongchao, Zhichao Hu, Cai Xinjun, Ziming Wang, Jinxuan Chen, Sitao Luan, Jiahao Xu, Lihui Chen. Findings of the Association for Computational Linguistics: ACL 2025. 2025.