Zhimeng Guo

Zhimeng Guo

Auto-generated profile, based on publicly available information

Zhimeng Guo

Pennsylvania State University

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
27 September 2024 in Machine Intelligence Research
Verified
Journal Article
Open access
PDF file
EDEnyan Dai
Enyan Dai
TZTianxiang Zhao
Tianxiang Zhao
HZHuaisheng Zhu
Huaisheng Zhu
JXJunjie Xu
Junjie Xu
ZGZhimeng Guo
Zhimeng Guo
SWSuhang Wang
Suhang Wang
Graph neural networks (GNNs) have made rapid developments in the recent years. Due to their great ability in modeling graph-structured data, GNNs are vastly used in various applications, including high-stakes scenarios such as financial analysis, traffic predictions, and drug discovery. Despite their great potential in benefiting humans in the real world, recent study shows that GNNs can leak private information, are vulnerable to adversarial attacks, can inherit and magnify societal bias from training data and lack interpretability, which have risk of causing unintentional harm to the users and society. For example, existing works demonstrate that attackers can fool the GNNs to give the outcome they desire with unnoticeable perturbation on training graph. GNNs trained on social networks may embed the discrimination in their decision process, strengthening the undesirable societal bias. Consequently, trust-worthy GNNs in various aspects are emerging to prevent the harm from GNN models and increase the users’ trust in GNNs. In this paper, we give a comprehensive survey of GNNs in the computational aspects of privacy, robustness, fairness, and explainability. For each aspect, we give the taxonomy of the related methods and formulate the general frameworks for the multiple categories of trustworthy GNNs. We also discuss the future research directions of each aspect and connections between these aspects to help achieve trustworthiness.

24 January 2025 in Machine Intelligence Research
Verified
Journal Article
Open access
PDF file
ZGZhimeng Guo
Zhimeng Guo
ZWZongyu Wu
Zongyu Wu
TXTeng Xiao
Teng Xiao
CACharu Aggarwal
Charu Aggarwal
HLHui Liu
Hui Liu
SWSuhang Wang
Suhang Wang
Graph-structured data are pervasive in the real-world such as social networks, molecular graphs and transaction networks. Graph neural networks (GNNs) have achieved great success in representation learning on graphs, facilitating various downstream tasks. However, GNNs have several drawbacks such as lacking interpretability, can easily inherit the bias of data and cannot model casual relations. Recently, counterfactual learning on graphs has shown promising results in alleviating these drawbacks. Various approaches have been proposed for counterfactual fairness, explainability, link prediction and other applications on graphs. To facilitate the development of this promising direction, in this survey, we categorize and comprehensively review papers on graph counterfactual learning. We divide existing methods into four categories based on problems studied. For each category, we provide background and motivating examples, a general framework summarizing existing works and a detailed review of these works. We point out promising future research directions at the intersection of graph-structured data, counterfactual learning, and real-world applications. To offer a comprehensive view of resources for future studies, we compile a collection of open-source implementations, public datasets, and commonly-used evaluation metrics. This survey aims to serve as a “one-stop-shop” for building a unified understanding of graph counterfactual learning categories and current resources.

21 October 2023
Verified
Conference Paper
Open access
ZGZhimeng Guo
Zhimeng Guo
JLJialiang Li
Jialiang Li
TXTeng Xiao
Teng Xiao
YMYao Ma
Yao Ma
SWSuhang Wang
Suhang Wang
Graph neural networks have shown great ability in representation (GNNs) learning on graphs, facilitating various tasks. Despite their great performance in modeling graphs, recent works show that GNNs tend to inherit and amplify the bias from training data, causing concerns of the adoption of GNNs in high-stake scenarios. Hence, many efforts have been taken for fairness-aware GNNs. However, most existing fair GNNs learn fair node representations by adopting statistical fairness notions, which may fail to alleviate bias in the presence of statistical anomalies. Motivated by causal theory, there are several attempts utilizing graph counterfactual fairness to mitigate root causes of unfairness. However, these methods suffer from non-realistic counterfactuals obtained by perturbation or generation. In this paper, we take a causal view on fair graph learning problem. Guided by the casual analysis, we propose a novel framework CAF, which can select counterfactuals from training data to avoid non-realistic counterfactuals and adopt selected counterfactuals to learn fair node representations for node classification task. Extensive experiments on synthetic and real-world datasets show the effectiveness of CAF. Our code is available at https://github.com/TimeLovercc/CAF-GNN.

1 January 2024
Verified
Conference Paper
Open access
PDF file
HZHangfan Zhang
Hangfan Zhang
ZGZhimeng Guo
Zhimeng Guo
HZHuaisheng Zhu
Huaisheng Zhu
BCBochuan Cao
Bochuan Cao
LLLu Lin
Lu Lin
DWDinghao Wu
Dinghao Wu
Hangfan Zhang, Zhimeng Guo, Huaisheng Zhu, Bochuan Cao, Lu Lin, Jinyuan Jia, Jinghui Chen, Dinghao Wu. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2024.

24 August 2024
Verified
Conference Paper
Open access
XQXiaowei Qian
Xiaowei Qian
ZGZhimeng Guo
Zhimeng Guo
JLJialiang Li
Jialiang Li
HMHaitao Mao
Haitao Mao
BLBingheng Li
Bingheng Li
YMYao Ma
Yao Ma
Fair graph learning plays a pivotal role in numerous practical applications. Recently, many fair graph learning methods have been proposed; however, their evaluation often relies on poorly constructed semi-synthetic datasets or substandard real-world datasets. In such cases, even a basic Multilayer Perceptron (MLP) can outperform Graph Neural Networks (GNNs) in both utility and fairness. In this work, we illustrate that many datasets fail to provide meaningful information in the edges, which may challenge the necessity of using graph structures in these problems. To address these issues, we develop and introduce a collection of synthetic, semi-synthetic, and real-world datasets that fulfill a broad spectrum of requirements. These datasets are thoughtfully designed to include relevant graph structures and bias information crucial for the fair evaluation of models. The proposed synthetic and semi-synthetic datasets offer the flexibility to create data with controllable bias parameters, thereby enabling the generation of desired datasets with user-defined bias values with ease. Moreover, we conduct systematic evaluations of these proposed datasets and establish a unified evaluation approach for fair graph learning models. Our extensive experimental results with fair graph learning methods across our datasets demonstrate their effectiveness in benchmarking the performance of these methods. Our datasets and the code for reproducing our experiments are available at https://github.com/XweiQ/Benchmark-GraphFairness.

1 January 2025
Verified
Conference Paper
Open access
PDF file
HZHuaisheng Zhu
Huaisheng Zhu
SXSiyuan Xu
Siyuan Xu
HZHangfan Zhang
Hangfan Zhang
TXTeng Xiao
Teng Xiao
ZGZhimeng Guo
Zhimeng Guo
VHVasant G. Honavar
Vasant G. Honavar
Huaisheng Zhu, Siyuan Xu, Hangfan Zhang, Teng Xiao, Zhimeng Guo, Shijie Zhou, Shuyue Hu, Vasant G. Honavar. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. 2025.