Fetching the paper…
Reading the bibliography…
Explainability is crucial for probing graph neural networks (GNNs), answering questions like "Why the GNN model makes a certain prediction?".
A. K. Debnath, R. L. Lopez de Compadre, G. Debnath, A. J. Shusterman, and C. Hansch, “Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. correlation with molecular orbital energies and hydrophobicity,” Journal of medicinal chemistry , vol. 34, no. 2, pp. 786–797, 1991
1991
Earlier work this paper cites.
R. S. Sutton, D. A. McAllester, S. P. Singh, and Y. Mansour, “Policy gradient methods for reinforcement learning with function approximation,” in NeurIPS , 1999, pp. 1057–1063
1999
Earlier work this paper cites.
——, Causality: Models, Reasoning, and Inference . Cambridge University Press, 2000
2000
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory . Wiley, 2001
2001
Earlier work this paper cites.
I. Tsamardinos, C. F. Aliferis, and A. R. Statnikov, “Algorithms for large scale markov blanket discovery,” in FLAIRS , 2003, pp. 376–381
2003
Earlier work this paper cites.
J. Leskovec, J. M. Kleinberg, and C. Faloutsos, “Graphs over time: densification laws, shrinking diameters and possible explanations,” in KDD , 2005, pp. 177–187
2005
Earlier work this paper cites.
J. Kazius, R. McGuire, and R. Bursi, “Derivation and validation of toxicophores for mutagenicity prediction,” Journal of medicinal chemistry , vol. 48, no. 1, pp. 312–320, 2005
2005
Earlier work this paper cites.
K. Riesen and H. Bunke, “Iam graph database repository for graph based pattern recognition and machine learning,” in SPR and SSPR , 2008, pp. 287–297
2008
Earlier work this paper cites.
J. Pearl, Causality . Cambridge university press, 2009
2009
Earlier work this paper cites.
C. F. Aliferis, A. Statnikov, I. Tsamardinos, S. Mani, and X. D. Koutsoukos, “Local causal and markov blanket induction for causal discovery and feature selection for classification part i: Algorithms and empirical evaluation.” JMLR , vol. 11, no. 1, 2010
2010
Earlier work this paper cites.
K. Simonyan, A. Vedaldi, and A. Zisserman, “Deep inside convolutional networks: Visualising image classification models and saliency maps,” in ICLR , 2014
2014
Earlier work this paper cites.
S. Bach, A. Binder, G. Montavon, F. Klauschen, K.-R. Müller, and W. Samek, “On pixel-wise explanations for non-linear classifier decisions by layer-wise relevance propagation,” PloS one , vol. 10, no. 7, 2015
2015
Earlier work this paper cites.
P. Yanardag and S. V. N. Vishwanathan, “Deep graph kernels,” in KDD , 2015, pp. 1365–1374
2015
Earlier work this paper cites.
M. T. Ribeiro, S. Singh, and C. Guestrin, “”why should I trust you?”: Explaining the predictions of any classifier,” in KDD , 2016, pp. 1135–1144
2016
Earlier work this paper cites.
J. Pearl, M. Glymour, and N. P. Jewell, Causal inference in statistics: A primer . John Wiley & Sons, 2016
2016
Earlier work this paper cites.
D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. Van Den Driessche, J. Schrittwieser, I. Antonoglou, V. Panneershelvam, M. Lanctot et al. , “Mastering the game of go with deep neural networks and tree search,” nature , vol. 529, no. 7587, pp. 484–489, 2016
2016
Earlier work this paper cites.
W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NeurIPS , 2017, pp. 1024–1034
2017
Earlier work this paper cites.
A. Shrikumar, P. Greenside, and A. Kundaje, “Learning important features through propagating activation differences,” in ICML , vol. 70, 2017, pp. 3145–3153
2017
Earlier work this paper cites.
R. R. Selvaraju, M. Cogswell, A. Das, R. Vedantam, D. Parikh, and D. Batra, “Grad-cam: Visual explanations from deep networks via gradient-based localization,” in ICCV , 2017, pp. 618–626
2017
Earlier work this paper cites.
M. Sundararajan, A. Taly, and Q. Yan, “Axiomatic attribution for deep networks,” in ICML , vol. 70, 2017, pp. 3319–3328
2017
Earlier work this paper cites.
S. M. Lundberg and S. Lee, “A unified approach to interpreting model predictions,” in NeurIPS , 2017, pp. 4765–4774
2017
Earlier work this paper cites.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in ICML , vol. 70, 2017, pp. 1263–1272
2017
Cited alongside, same era.
R. Krishna, Y. Zhu, O. Groth, J. Johnson, K. Hata, J. Kravitz, S. Chen, Y. Kalantidis, L. Li, D. A. Shamma, M. S. Bernstein, and L. Fei-Fei, “Visual genome: Connecting language and vision using crowdsourced dense image annotations,” IJCV , vol. 123, no. 1, pp. 32–73, 2017
2017
Cited alongside, same era.
M. Ancona, E. Ceolini, C. Öztireli, and M. Gross, “Towards better understanding of gradient-based attribution methods for deep neural networks,” in ICLR , 2018
2018
Cited alongside, same era.
J. Pearl, “Theoretical impediments to machine learning with seven sparks from the causal revolution,” in WSDM , 2018, p. 3
2018
Cited alongside, same era.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR , 2017
2019
Later among the works it cites.
2020
Later among the works it cites.
H. Yuan, J. Tang, X. Hu, and S. Ji, “XGNN: towards model-level explanations of graph neural networks,” in KDD , R. Gupta, Y. Liu, J. Tang, and B. A. Prakash, Eds., 2020, pp. 430–438
2020
Later among the works it cites.
T. Schnake, O. Eberle, J. Lederer, S. Nakajima, K. T. Schutt, K.-R. Muller, and G. Montavon, “Higher-order explanations of graph neural networks via relevant walks.” arXiv , 2020
2020
Later among the works it cites.
D. Luo, W. Cheng, D. Xu, W. Yu, B. Zong, H. Chen, and X. Zhang, “Parameterized explainer for graph neural network,” in NeurIPS , 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Chen, L. Song, M. J. Wainwright, and M. I. Jordan, “Learning to explain: An information-theoretic perspective on model interpretation,” in ICML , 2018, pp. 882–891
2018
Cited alongside, same era.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in ICLR , 2018
2018
Cited alongside, same era.
M. I. Belghazi, A. Baratin, S. Rajeswar, S. Ozair, Y. Bengio, R. D. Hjelm, and A. C. Courville, “Mutual information neural estimation,” in ICML , vol. 80, 2018, pp. 530–539
2018
Cited alongside, same era.
J. You, B. Liu, Z. Ying, V. S. Pande, and J. Leskovec, “Graph convolutional policy network for goal-directed molecular graph generation,” in NeurIPS , 2018, pp. 6412–6422
2018
Cited alongside, same era.
Q. Liu, M. Allamanis, M. Brockschmidt, and A. L. Gaunt, “Constrained graph variational autoencoders for molecule design,” in NeurIPS , 2018, pp. 7806–7815
2018
Cited alongside, same era.
J. Adebayo, J. Gilmer, M. Muelly, I. J. Goodfellow, M. Hardt, and B. Kim, “Sanity checks for saliency maps,” in NeurIPS , 2018, pp. 9525–9536
2018
Cited alongside, same era.
C. Rudin, “Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead,” Nature Machine Intelligence , vol. 1, no. 5, pp. 206–215, 2019
2019
Cited alongside, same era.
A. Chattopadhyay, P. Manupriya, A. Sarkar, and V. N. Balasubramanian, “Neural network attributions: A causal perspective,” in ICML , vol. 97, 2019, pp. 981–990
2019
Cited alongside, same era.
2020
Later among the works it cites.
M. N. Vu and M. T. Thai, “Pgm-explainer: Probabilistic graphical model explanations for graph neural networks,” in NeurIPS , 2020
2020
Later among the works it cites.
R. Moraffah, M. Karami, R. Guo, A. Raglin, and H. Liu, “Causal interpretability for machine learning-problems, methods and evaluation,” SIGKDD Explorations , vol. 22, no. 1, pp. 18–33, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
S. Zhu, I. Ng, and Z. Chen, “Causal discovery with reinforcement learning,” in ICLR , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
W. Hu, B. Liu, J. Gomes, M. Zitnik, P. Liang, V. S. Pande, and J. Leskovec, “Strategies for pre-training graph neural networks,” in ICLR , 2020
2020
Later among the works it cites.
J. Liang, B. Bai, Y. Cao, K. Bai, and F. Wang, “Adversarial infidelity learning for model interpretation,” in KDD , 2020, pp. 286–296
2020
Later among the works it cites.
E. Ranjan, S. Sanyal, and P. P. Talukdar, “ASAP: adaptive structure aware pooling for learning hierarchical graph representations,” in AAAI , 2020, pp. 5470–5477
2020
Later among the works it cites.
H. Yuan, H. Yu, J. Wang, K. Li, and S. Ji, “On explainability of graph neural networks via subgraph explorations,” in ICML , 2021
2021
Later among the works it cites.
X. Wang, Y. Wu, A. Zhang, X. He, and T.-S. Chua, “Towards multi-grained explainability for graph neural networks,” NeurIPS , vol. 34, 2021
2021
Later among the works it cites.
C. Frye, D. de Mijolla, L. Cowton, M. Stanley, and I. Feige, “Shapley-based explainability on the data manifold,” in ICLR , 2021
2021
Later among the works it cites.
B. Bevilacqua, Y. Zhou, and B. Ribeiro, “Size-invariant graph representations for graph classification extrapolations,” in ICML , ser. Proceedings of Machine Learning Research, vol. 139. PMLR, 2021, pp. 837–851
2021
Later among the works it cites.
J. Zeng, X. Wang, J. Liu, Y. Chen, Z. Liang, T. Chua, and Z. L. Chua, “Shadewatcher: Recommendation-guided cyber threat analysis using system audit records,” in IEEE Symposium on Security and Privacy , 2022
2022
Closest in time.
Y. Wu, X. Wang, A. Zhang, X. He, and T. seng Chua, “Discovering invariant rationales for graph neural networks,” in ICLR , 2022
2022
Closest in time.
Y. Li, X. Wang, J. Xiao, W. Ji, and T. seng Chua, “Invariant grounding for video question answering,” in CVPR , 2022
2022
Closest in time.