activity
20192023
most citedOn Explainability of Graph Neural Networks via Subgraph Explorations

90 citations · 225 across the 17 of their papers we have counts for

collaborators
Showing cs.LGShow all

11 papers · 1 filter

cs.LG2023

Provably Convergent Subgraph-wise Sampling for Fast GNN Training

Jie Wang, Zhihao Shi, Xize Liang +5

Subgraph-wise sampling -- a promising class of mini-batch training techniques for graph neural networks (GNNs -- is critical for real-world applications. During the message passing…

cs.LG2023★ 8 cited

De Novo Molecular Generation via Connection-aware Motif Mining

Zijie Geng, Shufang Xie, Yingce Xia +6

De novo molecular generation is an essential task for science discovery. Recently, fragment-based deep generative models have attracted much research attention due to their flexibi…

cs.LG2023

Generalization in Visual Reinforcement Learning with the Reward Sequence Distribution

Jie Wang, Rui Yang, Zijie Geng +7

Generalization in partially observed markov decision processes (POMDPs) is critical for successful applications of visual reinforcement learning (VRL) in real scenarios. A widely u…

cs.LG2022★ 14 cited

Learning Task-relevant Representations for Generalization via Characteristic Functions of Reward Sequence Distributions

Rui Yang, Jie Wang, Zijie Geng +4

Generalization across different environments with the same tasks is critical for successful applications of visual reinforcement learning (RL) in real scenarios. However, visual di…

cs.LG2022★ 2 cited

FlowX: Towards Explainable Graph Neural Networks via Message Flows

Shurui Gui, Hao Yuan, Jie Wang +3

We investigate the explainability of graph neural networks (GNNs) as a step toward elucidating their working mechanisms. While most current methods focus on explaining graph nodes,…

cs.LG2022★ 1 cited

Compressing Deep Graph Neural Networks via Adversarial Knowledge Distillation

Huarui He, Jie Wang, Zhanqiu Zhang +1

Deep graph neural networks (GNNs) have been shown to be expressive for modeling graph-structured data. Nevertheless, the over-stacked architecture of deep graph models makes it dif…

cs.LG2021★ 12 cited

Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs

Jiajun Chen, Huarui He, Feng Wu +1

Inductive link prediction -- where entities during training and inference stages can be different -- has been shown to be promising for completing continuously evolving knowledge g…

cs.LG2021★ 90 cited

On Explainability of Graph Neural Networks via Subgraph Explorations

Hao Yuan, Haiyang Yu, Jie Wang +2

We consider the problem of explaining the predictions of graph neural networks (GNNs), which otherwise are considered as black boxes. Existing methods invariably focus on explainin…

cs.LG2020★ 21 cited

Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion

Zhanqiu Zhang, Jianyu Cai, Jie Wang

Tensor factorization based models have shown great power in knowledge graph completion (KGC). However, their performance usually suffers from the overfitting problem seriously. Thi…

cs.LG2020★ 4 cited

Line Graph Neural Networks for Link Prediction

Lei Cai, Jundong Li, Jie Wang +1

We consider the graph link prediction task, which is a classic graph analytical problem with many real-world applications. With the advances of deep learning, current link predicti…

cs.LG2019★ 27 cited

Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction

Zhanqiu Zhang, Jianyu Cai, Yongdong Zhang +1

Knowledge graph embedding, which aims to represent entities and relations as low dimensional vectors (or matrices, tensors, etc.), has been shown to be a powerful technique for pre…