Fetching the paper…
Reading the bibliography…
In this work, we investigate the problem of out-of-distribution (OOD) generalization for unsupervised learning methods on graph data.
M. D. Donsker and S. S. Varadhan, “Asymptotic evaluation of certain markov process expectations for large time, i,” Communications on Pure and Applied Mathematics , vol. 28, no. 1, pp. 1–47, 1975
1975
Earlier work this paper cites.
V. Vapnik, “Principles of risk minimization for learning theory,” Advances in neural information processing systems , vol. 4, 1991
1991
Earlier work this paper cites.
V. N. Vapnik, “An overview of statistical learning theory,” IEEE transactions on neural networks , vol. 10, no. 5, pp. 988–999, 1999
1999
Earlier work this paper cites.
V. Batagelj, “Efficient algorithms for citation network analysis,” arXiv preprint cs/0309023 , 2003
2003
Earlier work this paper cites.
M. E. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical review E , vol. 69, no. 2, p. 026113, 2004
2004
Earlier work this paper cites.
L. Van der Maaten and G. Hinton, “Visualizing data using t-sne.” Journal of machine learning research , vol. 9, no. 11, 2008
2008
Earlier work this paper cites.
S. J. Pan and Q. Yang, “A survey on transfer learning,” IEEE Transactions on Knowledge and Data Engineering , vol. 22, no. 10, pp. 1345–1359, 2010
2010
Earlier work this paper cites.
M. Gutmann and A. Hyvärinen, “Noise-contrastive estimation: A new estimation principle for unnormalized statistical models,” in Proceedings of the thirteenth international conference on artificial intelligence and statistics . JMLR Workshop and Conference Proceedings, 2010, pp. 297–304
2010
Earlier work this paper cites.
X. Nguyen, M. J. Wainwright, and M. I. Jordan, “Estimating divergence functionals and the likelihood ratio by convex risk minimization,” IEEE Transactions on Information Theory , vol. 56, no. 11, pp. 5847–5861, 2010
2010
Earlier work this paper cites.
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg et al. , “Scikit-learn: Machine learning in python,” the Journal of machine Learning research , vol. 12, pp. 2825–2830, 2011
2011
Earlier work this paper cites.
M. Cuturi, “Sinkhorn distances: Lightspeed computation of optimal transport,” Advances in neural information processing systems , vol. 26, 2013
2013
Earlier work this paper cites.
N. Tishby and N. Zaslavsky, “Deep learning and the information bottleneck principle,” in 2015 ieee information theory workshop (itw) . IEEE, 2015, pp. 1–5
2015
Earlier work this paper cites.
J. Peters, P. Bühlmann, and N. Meinshausen, “Causal inference by using invariant prediction: identification and confidence intervals,” Journal of the Royal Statistical Society Series B: Statistical Methodology , vol. 78, no. 5, pp. 947–1012, 2016
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
S. Nowozin, B. Cseke, and R. Tomioka, “f-gan: Training generative neural samplers using variational divergence minimization,” Advances in neural information processing systems , vol. 29, 2016
2016
Earlier work this paper cites.
Z. Yang, W. Cohen, and R. Salakhudinov, “Revisiting semi-supervised learning with graph embeddings,” in International conference on machine learning . PMLR, 2016, pp. 40–48
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” NIPS Workshop on Bayesian Deep Learning , 2016
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in International Conference on Learning Representations (ICLR) , 2017
2017
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” Advances in neural information processing systems , vol. 30, 2017
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 International conference on machine learning . PMLR, 2017, pp. 1263–1272
2017
Earlier work this paper cites.
H. Cai, V. W. Zheng, and K. C.-C. Chang, “A comprehensive survey of graph embedding: Problems, techniques, and applications,” IEEE Transactions on Knowledge and Data Engineering , vol. 30, no. 9, pp. 1616–1637, 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
C. Heinze-Deml, J. Peters, and N. Meinshausen, “Invariant causal prediction for nonlinear models,” Journal of Causal Inference , vol. 6, no. 2, p. 20170016, 2018
2018
Earlier work this paper cites.
M. I. Belghazi, A. Baratin, S. Rajeshwar, S. Ozair, Y. Bengio, A. Courville, and D. Hjelm, “Mutual information neural estimation,” in International conference on machine learning . PMLR, 2018, pp. 531–540
2018
Earlier work this paper cites.
C. Chen, W. Ye, Y. Zuo, C. Zheng, and S. P. Ong, “Graph networks as a universal machine learning framework for molecules and crystals,” Chemistry of Materials , vol. 31, no. 9, pp. 3564–3572, 2019
2019
Earlier work this paper cites.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in International Conference on Learning Representations , 2019. [Online]. Available: https://openreview.net/forum?id=ryGs6iA5Km
2019
Earlier work this paper cites.
P. Velickovic, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep graph infomax,” in Proc. of ICLR , 2019
2019
Earlier work this paper cites.
J. Lu, A. Liu, F. Dong, F. Gu, J. Gama, and G. Zhang, “Learning under concept drift: A review,” IEEE Transactions on Knowledge and Data Engineering , vol. 31, no. 12, pp. 2346–2363, 2019
2019
Cited alongside, same era.
2019
Cited alongside, same era.
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!” Advances in Neural Information Processing Systems , vol. 32, 2019
2019
Cited alongside, same era.
Z. Ying, D. Bourgeois, J. You, M. Zitnik, and J. Leskovec, “Gnnexplainer: Generating explanations for graph neural networks,” Advances in neural information processing systems , vol. 32, 2019
2019
Cited alongside, same era.
Q. Zhu, C. Yang, Y. Xu, H. Wang, C. Zhang, and J. Han, “Transfer learning of graph neural networks with ego-graph information maximization,” Advances in Neural Information Processing Systems , vol. 34, pp. 1766–1779, 2021
2021
Later among the works it cites.
K. Ahuja, E. Caballero, D. Zhang, J.-C. Gagnon-Audet, Y. Bengio, I. Mitliagkas, and I. Rish, “Invariance principle meets information bottleneck for out-of-distribution generalization,” Advances in Neural Information Processing Systems , vol. 34, pp. 3438–3450, 2021
2021
Later among the works it cites.
S. Suresh, P. Li, C. Hao, and J. Neville, “Adversarial graph augmentation to improve graph contrastive learning,” Advances in Neural Information Processing Systems , vol. 34, pp. 15 920–15 933, 2021
2021
Later among the works it cites.
R. Liu, J. Gao, J. Zhang, D. Meng, and Z. Lin, “Investigating bi-level optimization for learning and vision from a unified perspective: A survey and beyond,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 44, no. 12, pp. 10 045–10 067, 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Fey and J. E. Lenssen, “Fast graph representation learning with pytorch geometric,” ArXiv preprint , 2019
2019
Cited alongside, same era.
A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. Köpf, E. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, L. Fang, J. Bai, and S. Chintala, “Pytorch: An imperative style, high-performance deep learning library,” in Proc. of NeurIPS , 2019
2019
Cited alongside, same era.
R. A. Rossi, R. Zhou, and N. K. Ahmed, “Deep inductive graph representation learning,” IEEE Transactions on Knowledge and Data Engineering , vol. 32, no. 3, pp. 438–452, 2020
2020
Cited alongside, same era.
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,” Advances in neural information processing systems , vol. 33, pp. 22 118–22 133, 2020
2020
Cited alongside, same era.
Y. Zhu, Y. Xu, F. Yu, Q. Liu, S. Wu, and L. Wang, “Deep Graph Contrastive Representation Learning,” in ICML Workshop on Graph Representation Learning and Beyond , 2020
2020
Cited alongside, same era.
Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, and Y. Shen, “Graph contrastive learning with augmentations,” Advances in Neural Information Processing Systems , vol. 33, pp. 5812–5823, 2020
2020
Cited alongside, same era.
K. Hassani and A. H. Khasahmadi, “Contrastive multi-view representation learning on graphs,” in International Conference on Machine Learning . PMLR, 2020, pp. 4116–4126
2020
Cited alongside, same era.
M. Wu, S. Pan, C. Zhou, X. Chang, and X. Zhu, “Unsupervised domain adaptive graph convolutional networks,” in Proceedings of The Web Conference 2020 , 2020, pp. 1457–1467
2020
Cited alongside, same era.
2021
Later among the works it cites.
M. Ding, K. Kong, J. Chen, J. Kirchenbauer, M. Goldblum, D. Wipf, F. Huang, and T. Goldstein, “A closer look at distribution shifts and out-of-distribution generalization on graphs,” in NeurIPS 2021 Workshop on Distribution Shifts: Connecting Methods and Applications , 2021. [Online]. Available: https://openreview.net/forum?id=XvgPGWazqRH
2021
Later among the works it cites.
E. Rosenfeld, P. Ravikumar, and A. Risteski, “The risks of invariant risk minimization,” in International Conference on Learning Representations , vol. 9, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
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
Later among the works it cites.
Y. Zhu, J. Guo, F. Wu, and S. Tang, “Rosa: A robust self-aligned framework for node-node graph contrastive learning,” in Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22 , L. D. Raedt, Ed. International Joint Conferences on Artificial Intelligence Organization, 7 2022, pp. 3795–3801, main Track. [Online]. Available: https://doi.org/10.24963/ijcai.2022/527
2022
Later among the works it cites.
Z. Hou, X. Liu, Y. Cen, Y. Dong, H. Yang, C. Wang, and J. Tang, “Graphmae: Self-supervised masked graph autoencoders,” ser. KDD ’22. New York, NY, USA: Association for Computing Machinery, 2022, p. 594–604. [Online]. Available: https://doi.org/10.1145/3534678.3539321
2022
Later among the works it cites.
Y. Zhang, H. Zhu, Z. Song, P. Koniusz, and I. King, “Costa: Covariance-preserving feature augmentation for graph contrastive learning,” in Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , 2022, pp. 2524–2534
2022
Later among the works it cites.
J. Wang, C. Lan, C. Liu, Y. Ouyang, T. Qin, W. Lu, Y. Chen, W. Zeng, and P. Yu, “Generalizing to unseen domains: A survey on domain generalization,” IEEE Transactions on Knowledge and Data Engineering , pp. 1–1, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
X. Zhou, Y. Lin, W. Zhang, and T. Zhang, “Sparse invariant risk minimization,” in International Conference on Machine Learning . PMLR, 2022, pp. 27 222–27 244
2022
Later among the works it cites.
S. Miao, M. Liu, and P. Li, “Interpretable and generalizable graph learning via stochastic attention mechanism,” in International Conference on Machine Learning . PMLR, 2022, pp. 15 524–15 543
2022
Later among the works it cites.
S. Li, X. Wang, A. Zhang, Y. Wu, X. He, and T.-S. Chua, “Let invariant rationale discovery inspire graph contrastive learning,” in International Conference on Machine Learning . PMLR, 2022, pp. 13 052–13 065
2022
Later among the works it cites.
2022
Later among the works it cites.
B. Li, Y. Shen, Y. Wang, W. Zhu, D. Li, K. Keutzer, and H. Zhao, “Invariant information bottleneck for domain generalization,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 36, no. 7, 2022, pp. 7399–7407
2022
Later among the works it cites.
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 Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2022, pp. 60–69
2022
Later among the works it cites.
2022
Later among the works it cites.
Y. Xie, Z. Xu, J. Zhang, Z. Wang, and S. Ji, “Self-supervised learning of graph neural networks: A unified review,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 45, no. 2, pp. 2412–2429, 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
Y. Liu, M. Jin, S. Pan, C. Zhou, Y. Zheng, F. Xia, and P. S. Yu, “Graph self-supervised learning: A survey,” IEEE Transactions on Knowledge and Data Engineering , vol. 35, no. 6, pp. 5879–5900, 2023
2023
Closest in time.
W. Huang, M. Yi, X. Zhao, and Z. Jiang, “Towards the generalization of contrastive self-supervised learning,” in The Eleventh International Conference on Learning Representations , 2023. [Online]. Available: https://openreview.net/forum?id=XDJwuEYHhme
2023
Closest in time.
W. Hu, G. Niu, I. Sato, and M. Sugiyama, “Does distributionally robust supervised learning give robust classifiers?” in International Conference on Machine Learning . PMLR, 2018, pp. 2029–2037
2037
Closest in time.