Fetching the paper…
Reading the bibliography…
Graph Neural Networks (GNNs) are proposed without considering the agnostic distribution shifts between training and testing graphs, inducing the degeneration of the generalization ability of GNNs on Out-Of-Distribution (OOD) settings.
A. Leman and B. Weisfeiler, “A reduction of a graph to a canonical form and an algebra arising during this reduction,” Nauchno-Technicheskaya Informatsiya , vol. 2, no. 9, pp. 12–16, 1968
1968
Earlier work this paper cites.
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.
G. W. Imbens and J. D. Angrist, “Identification and estimation of local average treatment effects,” Econometrica , pp. 467–475, 1994
1994
Earlier work this paper cites.
M. Riesenhuber and T. Poggio, “Models of object recognition,” Nature neuroscience , vol. 3, no. 11, pp. 1199–1204, 2000
2000
Earlier work this paper cites.
A. Gretton, O. Bousquet, A. Smola, and B. Schölkopf, “Measuring statistical dependence with hilbert-schmidt norms,” in International conference on algorithmic learning theory . Springer, 2005, pp. 63–77
2005
Earlier work this paper cites.
J. Huang and C. X. Ling, “Using auc and accuracy in evaluating learning algorithms,” TKDE , vol. 17, no. 3, pp. 299–310, 2005
2005
Earlier work this paper cites.
L. Song, A. Smola, A. Gretton, K. M. Borgwardt, and J. Bedo, “Supervised feature selection via dependence estimation,” in ICML , 2007, pp. 823–830
2007
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE Transactions on Neural Networks , vol. 20, no. 1, pp. 61–80, 2008
2008
Earlier work this paper cites.
N. Shervashidze, S. Vishwanathan, T. Petri, K. Mehlhorn, and K. Borgwardt, “Efficient graphlet kernels for large graph comparison,” in Artificial intelligence and statistics . PMLR, 2009, pp. 488–495
2009
Earlier work this paper cites.
N. Shervashidze, P. Schweitzer, E. J. Van Leeuwen, K. Mehlhorn, and K. M. Borgwardt, “Weisfeiler-lehman graph kernels.” Journal of Machine Learning Research , vol. 12, no. 9, 2011
2011
Earlier work this paper cites.
J. Hainmueller, “Entropy balancing for causal effects: A multivariate reweighting method to produce balanced samples in observational studies,” Political Analysis , vol. 20, no. 1, pp. 25–46, 2012
2012
Earlier work this paper cites.
L. Song, A. Smola, A. Gretton, J. Bedo, and K. Borgwardt, “Feature selection via dependence maximization.” Journal of Machine Learning Research , vol. 13, no. 5, 2012
2012
Earlier work this paper cites.
2014
Earlier work this paper cites.
J. R. Zubizarreta, “Stable weights that balance covariates for estimation with incomplete outcome data,” Journal of the American Statistical Association , vol. 110, no. 511, pp. 910–922, 2015
2015
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR , 2016
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in CVPR , 2016, pp. 770–778
2016
Earlier work this paper cites.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, “Graph attention networks,” in ICLR , 2017
2017
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NeurIPS , 2017, pp. 1024–1034
2017
Earlier work this paper cites.
B. M. Lake, T. D. Ullman, J. B. Tenenbaum, and S. J. Gershman, “Building machines that learn and think like people,” Behavioral and brain sciences , vol. 40, 2017
2017
Earlier work this paper cites.
D. Lopez-Paz, R. Nishihara, S. Chintala, B. Scholkopf, and L. Bottou, “Discovering causal signals in images,” in CVPR , 2017, pp. 6979–6987
2017
Earlier work this paper cites.
X. Wang, P. Cui, J. Wang, J. Pei, W. Zhu, and S. Yang, “Community preserving network embedding,” in Proceedings of the AAAI conference on artificial intelligence , vol. 31, no. 1, 2017
2017
Earlier work this paper cites.
F. Monti, D. Boscaini, J. Masci, E. Rodola, J. Svoboda, and M. M. Bronstein, “Geometric deep learning on graphs and manifolds using mixture model cnns,” in CVPR , 2017, pp. 5115–5124
2017
Earlier work this paper cites.
J. B. Lee, R. Rossi, and X. Kong, “Graph classification using structural attention,” in SIGKDD , 2018, pp. 1666–1674
2018
Earlier work this paper cites.
R. Ying, J. You, C. Morris, X. Ren, W. L. Hamilton, and J. Leskovec, “Hierarchical graph representation learning with differentiable pooling,” in NeurIPS , 2018
2018
Earlier work this paper cites.
M. Zhang, Z. Cui, M. Neumann, and Y. Chen, “An end-to-end deep learning architecture for graph classification,” in AAAI , 2018
2018
Cited alongside, same era.
M. Schlichtkrull, T. N. Kipf, P. Bloem, R. Van Den Berg, I. Titov, and M. Welling, “Modeling relational data with graph convolutional networks,” in European semantic web conference . Springer, 2018, pp. 593–607
2018
Cited alongside, same era.
M. Zhang and Y. Chen, “Link prediction based on graph neural networks,” in NeurIPS , vol. 31, 2018, pp. 5165–5175
2018
Cited alongside, same era.
K. Kuang, P. Cui, S. Athey, R. Xiong, and B. Li, “Stable prediction across unknown environments,” in SIGKDD , 2018, pp. 1617–1626
2018
Cited alongside, same era.
Z. Shen, P. Cui, K. Kuang, B. Li, and P. Chen, “Causally regularized learning with agnostic data selection bias,” in ACM MM , 2018, pp. 411–419
2018
E. Rosenfeld, P. Ravikumar, and A. Risteski, “The risks of invariant risk minimization,” in ICLR , 2020
2020
Later among the works it cites.
F. Qiao, L. Zhao, and X. Peng, “Learning to learn single domain generalization,” in CVPR , 2020, pp. 12 556–12 565
2020
Later among the works it cites.
T. Matsuura and T. Harada, “Domain generalization using a mixture of multiple latent domains,” in AAAI , vol. 34, no. 07, 2020, pp. 11 749–11 756
2020
Later among the works it cites.
K. Kuang, R. Xiong, P. Cui, S. Athey, and B. Li, “Stable prediction with model misspecification and agnostic distribution shift,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 34, no. 04, 2020, pp. 4485–4492
2020
Later among the works it cites.
Z. Shen, P. Cui, T. Zhang, and K. Kuang, “Stable learning via sample reweighting.” in AAAI , 2020, pp. 5692–5699
2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Z. Wu, B. Ramsundar, E. N. Feinberg, J. Gomes, C. Geniesse, A. S. Pappu, K. Leswing, and V. Pande, “Moleculenet: a benchmark for molecular machine learning,” Chemical science , vol. 9, no. 2, pp. 513–530, 2018
2018
Cited alongside, same era.
K. Xu, C. Li, Y. Tian, T. Sonobe, K.-i. Kawarabayashi, and S. Jegelka, “Representation learning on graphs with jumping knowledge networks,” in ICML . PMLR, 2018, pp. 5453–5462
2018
Cited alongside, same era.
R. Ying, D. Bourgeois, J. You, M. Zitnik, and J. Leskovec, “Gnnexplainer: Generating explanations for graph neural networks,” in NeurIPS , 2019
2019
Cited alongside, same era.
P. E. Pope, S. Kolouri, M. Rostami, C. E. Martin, and H. Hoffmann, “Explainability methods for graph convolutional neural networks,” in CVPR , 2019, pp. 10 772–10 781
2019
Cited alongside, same era.
2019
Cited alongside, same era.
L. Engstrom, B. Tran, D. Tsipras, L. Schmidt, and A. Madry, “Exploring the landscape of spatial robustness,” in ICML . PMLR, 2019, pp. 1802–1811
2019
Cited alongside, same era.
J. Su, D. V. Vargas, and K. Sakurai, “One pixel attack for fooling deep neural networks,” TEC , vol. 23, no. 5, pp. 828–841, 2019
2019
Cited alongside, same era.
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
2020
Later among the works it cites.
H. Zou, P. Cui, B. Li, Z. Shen, J. Ma, H. Yang, and Y. He, “Counterfactual prediction for bundle treatment,” NeurIPS , vol. 33, 2020
2020
Later among the works it cites.
D. Krueger, E. Caballero, J.-H. Jacobsen, A. Zhang, J. Binas, D. Zhang, R. Le Priol, and A. Courville, “Out-of-distribution generalization via risk extrapolation (rex),” in ICML , 2021, pp. 5815–5826
2021
Closest in time.
X. Zhang, P. Cui, R. Xu, L. Zhou, Y. He, and Z. Shen, “Deep stable learning for out-of-distribution generalization,” in CVPR , 2021, pp. 5372–5382
2021
Closest in time.
D. Bo, X. Wang, C. Shi, and H. Shen, “Beyond low-frequency information in graph convolutional networks,” in AAAI , 2021
2021
Closest in time.
B. Schölkopf, F. Locatello, S. Bauer, N. R. Ke, N. Kalchbrenner, A. Goyal, and Y. Bengio, “Toward causal representation learning,” Proceedings of the IEEE , vol. 109, no. 5, pp. 612–634, 2021
2021
Closest in time.
P. Kamath, A. Tangella, D. Sutherland, and N. Srebro, “Does invariant risk minimization capture invariance?” in International Conference on Artificial Intelligence and Statistics . PMLR, 2021, pp. 4069–4077
2021
Closest in time.
W. Lin, H. Lan, and B. Li, “Generative causal explanations for graph neural networks,” in ICML , 2021
2021
Closest in time.
S. Ishida, T. Miyazaki, Y. Sugaya, and S. Omachi, “Graph neural networks with multiple feature extraction paths for chemical property estimation,” Molecules , vol. 26, no. 11, p. 3125, 2021
2021
Closest in time.
Y. Wang, “Survey on deep multi-modal data analytics: Collaboration, rivalry, and fusion,” ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM) , vol. 17, no. 1s, pp. 1–25, 2021
2021
Closest in time.
H. Li, X. Wang, Z. Zhang, and W. Zhu, “Ood-gnn: Out-of-distribution generalized graph neural network,” IEEE Transactions on Knowledge and Data Engineering , 2022
2022
Closest in time.
Y.-X. Wu, X. Wang, A. Zhang, X. He, and T.-S. Chua, “Discovering invariant rationales for graph neural networks,” in ICLR , 2022
2022
Closest in time.
Y. Chen, Y. Zhang, Y. Bian, H. Yang, M. Kaili, B. Xie, T. Liu, B. Han, and J. Cheng, “Learning causally invariant representations for out-of-distribution generalization on graphs,” in NeurIPS , vol. 35, 2022, pp. 22 131–22 148
2022
Closest in time.
H. Li, Z. Zhang, X. Wang, and W. Zhu, “Learning invariant graph representations for out-of-distribution generalization,” in Advances in Neural Information Processing Systems , 2022
2022
Closest in time.
S. Fan, X. Wang, Y. Mo, C. Shi, and J. Tang, “Debiasing graph neural networks via learning disentangled causal substructure,” NeurIPS , vol. 35, pp. 24 934–24 946, 2022
2022
Closest in time.
N. Yang, K. Zeng, Q. Wu, X. Jia, and J. Yan, “Learning substructure invariance for out-of-distribution molecular representations,” in NeurIPS , 2022
2022
Closest in time.
2022
Closest in time.
J. Chen, F. Dai, X. Gu, J. Zhou, B. Li, and W. Wang, “Universal domain adaptive network embedding for node classification,” in Proceedings of the 31st ACM International Conference on Multimedia , 2023, pp. 4022–4030
2023
Closest in time.
E. Pan and Z. Kang, “Beyond homophily: Reconstructing structure for graph-agnostic clustering,” in ICML , 2023
2023
Closest in time.
H. Gao and S. Ji, “Graph u-nets,” in ICML . PMLR, 2019, pp. 2083–2092
2092
Closest in time.