Fetching the paper…
Reading the bibliography…
Graph machine learning has been extensively studied in both academia and industry.
C. W. Granger, “Investigating causal relations by econometric models and cross-spectral methods,”
1969
Earlier work this paper cites.
W. K. Hastings, “Monte carlo sampling methods using markov chains and their applications,” 1970
1970
Earlier work this paper cites.
A. Balke and J. Pearl, “Probabilistic evaluation of counterfactual queries,”
1994
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,”
1998
Earlier work this paper cites.
M. McPherson, L. Smith-Lovin, and J. M. Cook, “Birds of a feather: Homophily in social networks,”
2001
Earlier work this paper cites.
O. Bousquet and A. Elisseeff, “Stability and generalization,”
2002
Earlier work this paper cites.
A. Gretton, K. Fukumizu, C. Teo, L. Song, B. Schölkopf, and A. Smola, “A kernel statistical test of independence,”
2007
Earlier work this paper cites.
A. Rahimi and B. Recht, “Random features for large-scale kernel machines,”
2007
Earlier work this paper cites.
A. Gretton, A. Smola, J. Huang, M. Schmittfull, K. Borgwardt, and B. Schölkopf, “Covariate shift by kernel mean matching,”
2009
Earlier work this paper cites.
R. Achanta, A. Shaji, K. Smith, A. Lucchi, P. Fua, and S. Süsstrunk, “Slic superpixels compared to state-of-the-art superpixel methods,”
2012
Earlier work this paper cites.
N. Tishby and N. Zaslavsky, “Deep learning and the information bottleneck principle,” in
2015
Earlier work this paper cites.
M. Long, Y. Cao, J. Wang, and M. Jordan, “Learning transferable features with deep adaptation networks,” in
2015
Earlier work this paper cites.
V. N. Vapnik and A. Y. Chervonenkis, “On the uniform convergence of relative frequencies of events to their probabilities,” in
2015
Earlier work this paper cites.
M. Glymour, J. Pearl, and N. P. Jewell,
2016
Earlier work this paper cites.
Y. Ganin, E. Ustinova, H. Ajakan, P. Germain, H. Larochelle, F. Laviolette, M. Marchand, and V. Lempitsky, “Domain-adversarial training of neural networks,”
2016
Earlier work this paper cites.
Q. Wang, Z. Mao, B. Wang, and L. Guo, “Knowledge graph embedding: A survey of approaches and applications,”
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in
2017
Earlier work this paper cites.
J. Qiu, J. Tang, H. Ma, Y. Dong, K. Wang, and J. Tang, “Deepinf: Social influence prediction with deep learning,” in
2018
Earlier work this paper cites.
B. Yu, H. Yin, and Z. Zhu, “Spatio-temporal graph convolutional networks: a deep learning framework for traffic forecasting,” in
2018
Earlier work this paper cites.
H. Zhang, M. Cisse, Y. N. Dauphin, and D. Lopez-Paz, “mixup: Beyond empirical risk minimization,”
2018
Earlier work this paper cites.
K. Kuang, P. Cui, S. Athey, R. Xiong, and B. Li, “Stable prediction across unknown environments,” in
2018
Earlier work this paper cites.
Z. Ying, J. You, C. Morris, X. Ren, W. Hamilton, and J. Leskovec, “Hierarchical graph representation learning with differentiable pooling,”
2018
Earlier work this paper cites.
J. Pearl and D. Mackenzie,
2018
Earlier work this paper cites.
F. Scarselli, A. C. Tsoi, and M. Hagenbuchner, “The vapnik–chervonenkis dimension of graph and recursive neural networks,”
2018
Earlier work this paper cites.
Y. Bengio, T. Deleu, N. Rahaman, R. Ke, S. Lachapelle, O. Bilaniuk, A. Goyal, and C. Pal, “A meta-transfer objective for learning to disentangle causal mechanisms,”
2019
Earlier work this paper cites.
J. Ma, P. Cui, K. Kuang, X. Wang, and W. Zhu, “Disentangled graph convolutional networks,” in
2019
Earlier work this paper cites.
M. Wu, S. Pan, X. Zhu, C. Zhou, and L. Pan, “Domain-adversarial graph neural networks for text classification,” in
2019
Earlier work this paper cites.
F. Feng, X. He, J. Tang, and T.-S. Chua, “Graph adversarial training: Dynamically regularizing based on graph structure,”
2019
Earlier work this paper cites.
A. Shafahi, M. Najibi, M. A. Ghiasi, Z. Xu, J. Dickerson, C. Studer, L. S. Davis, G. Taylor, and T. Goldstein, “Adversarial training for free!”
2019
Earlier work this paper cites.
V. Verma, A. Lamb, C. Beckham, A. Najafi, I. Mitliagkas, D. Lopez-Paz, and Y. Bengio, “Manifold mixup: Better representations by interpolating hidden states,” in
2019
Earlier work this paper cites.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in
2019
Earlier work this paper cites.
M. Arjovsky, L. Bottou, I. Gulrajani, and D. Lopez-Paz, “Invariant risk minimization,”
2019
Earlier work this paper cites.
W. Zellinger, B. A. Moser, T. Grubinger, E. Lughofer, T. Natschläger, and S. Saminger-Platz, “Robust unsupervised domain adaptation for neural networks via moment alignment,”
2019
Earlier work this paper cites.
F. Wu, A. Souza, T. Zhang, C. Fifty, T. Yu, and K. Weinberger, “Simplifying graph convolutional networks,” in
2019
Earlier work this paper cites.
H. Rahimian and S. Mehrotra, “Distributionally robust optimization: A review,”
2019
Earlier work this paper cites.
Q. Dou, D. Coelho de Castro, K. Kamnitsas, and B. Glocker, “Domain generalization via model-agnostic learning of semantic features,”
2019
Earlier work this paper cites.
B. Knyazev, G. W. Taylor, and M. Amer, “Understanding attention and generalization in graph neural networks,”
2019
Earlier work this paper cites.
S. Verma and Z.-L. Zhang, “Stability and generalization of graph convolutional neural networks,” in
2019
Earlier work this paper cites.
S. S. Du, K. Hou, R. R. Salakhutdinov, B. Poczos, R. Wang, and K. Xu, “Graph neural tangent kernel: Fusing graph neural networks with graph kernels,”
2019
Earlier work this paper cites.
R. Ying, D. Bourgeois, J. You, M. Zitnik, and J. Leskovec, “Gnnexplainer: Generating explanations for graph neural networks,”
2019
Earlier work this paper cites.
J. Devlin, M. Chang, K. Lee, and K. Toutanova, “BERT: pre-training of deep bidirectional transformers for language understanding,” in
2019
Earlier work this paper cites.
D. Mendez, A. Gaulton, A. P. Bento, J. Chambers, M. De Veij, E. Félix, M. P. Magariños, J. F. Mosquera, P. Mutowo, M. Nowotka
2019
Earlier work this paper cites.
W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, M. Catasta, and J. Leskovec, “Open graph benchmark: Datasets for machine learning on graphs,”
2020
Earlier work this paper cites.
S. Yang, Z. Zhang, J. Zhou, Y. Wang, W. Sun, X. Zhong, Y. Fang, Q. Yu, and Y. Qi, “Financial risk analysis for smes with graph-based supply chain mining.” in
2020
Earlier work this paper cites.
M. Liang, B. Yang, R. Hu, Y. Chen, R. Liao, S. Feng, and R. Urtasun, “Learning lane graph representations for motion forecasting,” in
2020
Earlier work this paper cites.
J. Shlomi, P. Battaglia, and J.-R. Vlimant, “Graph neural networks in particle physics,”
2020
Earlier work this paper cites.
M. J. Horry, S. Chakraborty, M. Paul, A. Ulhaq, B. Pradhan, M. Saha, and N. Shukla, “Covid-19 detection through transfer learning using multimodal imaging data,”
2020
Earlier work this paper cites.
2020
Earlier work this paper cites.
W. Feng, J. Zhang, Y. Dong, Y. Han, H. Luan, Q. Xu, Q. Yang, E. Kharlamov, and J. Tang, “Graph random neural networks for semi-supervised learning on graphs,”
2020
Earlier work this paper cites.
Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, and Y. Shen, “Graph contrastive learning with augmentations,”
2020
Earlier work this paper cites.
Y. Liu, X. Wang, S. Wu, and Z. Xiao, “Independence promoted graph disentangled networks,” in
2020
Cited alongside, same era.
Y. Yang, Z. Feng, M. Song, and X. Wang, “Factorizable graph convolutional networks,”
2020
Cited alongside, same era.
X. Guo, L. Zhao, Z. Qin, L. Wu, A. Shehu, and Y. Ye, “Interpretable deep graph generation with node-edge co-disentanglement,” in
2020
Cited alongside, same era.
W. Hu, B. Liu, J. Gomes, M. Zitnik, P. Liang, V. Pande, and J. Leskovec, “Strategies for pre-training graph neural networks,”
2020
Cited alongside, same era.
H. Guo, “Nonlinear mixup: Out-of-manifold data augmentation for text classification,” in
2020
Cited alongside, same era.
Y. Wang, W. Wang, Y. Liang, Y. Cai, J. Liu, and B. Hooi, “Nodeaug: Semi-supervised node classification with data augmentation,” in
A. Baranwal, K. Fountoulakis, and A. Jagannath, “Graph convolution for semi-supervised classification: Improved linear separability and out-of-distribution generalization,”
2021
Later among the works it cites.
J. Ko, T. Kwon, K. Shin, and J. Lee, “Learning to pool in graph neural networks for extrapolation,”
2021
Later among the works it cites.
L. Galke, B. Franke, T. Zielke, and A. Scherp, “Lifelong learning of graph neural networks for open-world node classification,” in
2021
Later among the works it cites.
K. Han, B. Lakshminarayanan, and J. Liu, “Reliable graph neural networks for drug discovery under distributional shift,”
2021
Later among the works it cites.
S. Wu, F. Sun, W. Zhang, X. Xie, and B. Cui, “Graph neural networks in recommender systems: a survey,”
2022
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2020
Cited alongside, same era.
M. L. Montero, C. J. Ludwig, R. P. Costa, G. Malhotra, and J. Bowers, “The role of disentanglement in generalisation,” in
2020
Cited alongside, same era.
2020
Cited alongside, same era.
A. Jaiswal, A. R. Babu, M. Z. Zadeh, D. Banerjee, and F. Makedon, “A survey on contrastive self-supervised learning,”
2020
Cited alongside, same era.
P. H. Le-Khac, G. Healy, and A. F. Smeaton, “Contrastive representation learning: A framework and review,”
2020
Cited alongside, same era.
S. Chang, Y. Zhang, M. Yu, and T. Jaakkola, “Invariant rationalization,” in
2020
Cited alongside, same era.
Y. You, T. Chen, Z. Wang, and Y. Shen, “When does self-supervision help graph convolutional networks?” in
2020
Cited alongside, same era.
H. Li, X. Wang, Z. Zhang, and W. Zhu, “Ood-gnn: Out-of-distribution generalized graph neural network,”
2022
Closest in time.
K. Zhou, Z. Liu, Y. Qiao, T. Xiang, and C. C. Loy, “Domain generalization: A survey,”
2022
Closest in time.
K. Ding, Z. Xu, H. Tong, and H. Liu, “Data augmentation for deep graph learning: A survey,”
2022
Closest in time.
2022
Closest in time.
Y. Liu, M. Jin, S. Pan, C. Zhou, Y. Zheng, F. Xia, and P. Yu, “Graph self-supervised learning: A survey,”
2022
Closest in time.
Y. Xie, Z. Xu, J. Zhang, Z. Wang, and S. Ji, “Self-supervised learning of graph neural networks: A unified review,”
2022
Closest in time.
L. Sun, Y. Dou, C. Yang, K. Zhang, J. Wang, S. Y. Philip, L. He, and B. Li, “Adversarial attack and defense on graph data: A survey,”
2022
Closest in time.
L. Wu, H. Lin, Y. Huang, and S. Z. Li, “Knowledge distillation improves graph structure augmentation for graph neural networks,” in
2022
Closest in time.
K. Kong, G. Li, M. Ding, Z. Wu, C. Zhu, B. Ghanem, G. Taylor, and T. Goldstein, “Robust optimization as data augmentation for large-scale graphs,” in
2022
Closest in time.
S. Liu, R. Ying, H. Dong, L. Li, T. Xu, Y. Rong, P. Zhao, J. Huang, and D. Wu, “Local augmentation for graph neural networks,” in
2022
Closest in time.
G. Liu, T. Zhao, J. Xu, T. Luo, and M. Jiang, “Graph rationalization with environment-based augmentations,” in
2022
Closest in time.
2022
Closest in time.
2022
Closest in time.
S. Fan, X. Wang, Y. Mo, C. Shi, and J. Tang, “Debiasing graph neural networks via learning disentangled causal substructure,” in
2022
Closest in time.
H. Li, Z. Zhang, X. Wang, and W. Zhu, “Disentangled graph contrastive learning with independence promotion,”
2022
Closest in time.
S. Fan, X. Wang, C. Shi, K. Kuang, N. Liu, and B. Wang, “Debiased graph neural networks with agnostic label selection bias,”
2022
Closest in time.
Y. Sui, X. Wang, J. Wu, M. Lin, X. He, and T.-S. Chua, “Causal attention for interpretable and generalizable graph classification,”
2022
Closest in time.
2022
Closest in time.
Y. Chen, Y. Zhang, Y. Bian, H. Yang, K. Ma, B. Xie, T. Liu, B. Han, and J. Cheng, “Learning causally invariant representations for out-of-distribution generalization on graphs,” in
2022
Closest in time.
Y. Zhou, G. Kutyniok, and B. Ribeiro, “Ood link prediction generalization capabilities of message-passing gnns in larger test graphs,”
2022
Closest in time.
T. Zhao, G. Liu, D. Wang, W. Yu, and M. Jiang, “Learning from counterfactual links for link prediction,” in
2022
Closest in time.
H. Li, Z. Zhang, X. Wang, and W. Zhu, “Learning invariant graph representations under distribution shifts,” in
2022
Closest in time.
Y.-X. Wu, X. Wang, A. Zhang, X. He, and T. seng Chua, “Discovering invariant rationales for graph neural networks,” in
2022
Closest in time.
S. Miao, M. Liu, and P. Li, “Interpretable and generalizable graph learning via stochastic attention mechanism,” in
2022
Closest in time.
Q. Wu, H. Zhang, J. Yan, and D. Wipf, “Handling distribution shifts on graphs: An invariance perspective,” in
2022
Closest in time.
Z. Zhang, X. Wang, Z. Zhang, H. Li, Z. Qin, and W. Zhu, “Dynamic graph neural networks under spatio-temporal distribution shift,” in
2022
Closest in time.
D. Buffelli, P. Liò, and F. Vandin, “Sizeshiftreg: a regularization method for improving size-generalization in graph neural networks,”
2022
Closest in time.
H. Liu, B. Hu, X. Wang, C. Shi, Z. Zhang, and J. Zhou, “Confidence may cheat: Self-training on graph neural networks under distribution shift,”
2022
Closest in time.
S. Li, X. Wang, A. Zhang, Y. Wu, X. He, and T.-S. Chua, “Let invariant rationale discovery inspire graph contrastive learning,” in
2022
Closest in time.
G. Chen, J. Zhang, X. Xiao, and Y. Li, “Graphtta: Test time adaptation on graph neural networks,”
2022
Closest in time.
2022
Closest in time.
X. Han, Z. Jiang, N. Liu, and X. Hu, “G-mixup: Graph data augmentation for graph classification,”
2022
Closest in time.
X. Wang, H. Chen, S. Tang, Z. Wu, and W. Zhu, “Disentangled representation learning,”
2022
Closest in time.
2022
Closest in time.
S. Gui, X. Li, L. Wang, and S. Ji, “GOOD: A graph out-of-distribution benchmark,” in
2022
Closest in time.
H. Yuan, H. Yu, S. Gui, and S. Ji, “Explainability in graph neural networks: A taxonomic survey,”
2022
Closest in time.
Y. Ji, L. Zhang, J. Wu, B. Wu, L.-K. Huang, T. Xu, Y. Rong, L. Li, J. Ren, D. Xue
2022
Closest in time.
S. Maskey, R. Levie, Y. Lee, and G. Kutyniok, “Generalization analysis of message passing neural networks on large random graphs,” in
2022
Closest in time.
Y. Qin, X. Wang, Z. Zhang, P. Xie, and W. Zhu, “Graph neural architecture search under distribution shifts,” in
2022
Closest in time.
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
2022
Closest in time.
R. Li, Y. Cao, Q. Zhu, G. Bi, F. Fang, Y. Liu, and Q. Li, “How does knowledge graph embedding extrapolate to unseen data: a semantic evidence view,”
2022
Closest in time.
2022
Closest in time.
Y. Wu, A. Bojchevski, and H. Huang, “Adversarial weight perturbation improves generalization in graph neural networks,”
2023
Closest in time.