Fetching the paper…
Reading the bibliography…
Self-supervised learning of graph neural networks (GNN) is in great need because of the widespread label scarcity issue in real-world graph/network data.
E. N. Gilbert, “Random graphs,” The Annals of Mathematical Statistics , vol. 30, no. 4, pp. 1141–1144, 1959
1959
Earlier work this paper cites.
P. Erdős and A. Rényi, “On random graphs i.” Publ. Math. Debrecen , vol. 6, pp. 290–297, 1959
1959
Earlier work this paper cites.
B. Weisfeiler and A. Leman, “A reduction of a graph to a canonical form and an algebra arising during this reduction,” Nauchno-Technicheskaya Informatsia , 1968
1968
Earlier work this paper cites.
R. Linsker, “Self-organization in a perceptual network,” Computer , vol. 21, no. 3, pp. 105–117, 1988
1988
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, H. White et al. , “Multilayer feedforward networks are universal approximators.” Neural Networks , vol. 2, no. 5, pp. 359–366, 1989
1989
Earlier work this paper cites.
G. Cybenko, “Approximation by superpositions of a sigmoidal function,” Mathematics of control, signals and systems , vol. 2, no. 4, pp. 303–314, 1989
1989
Earlier work this paper cites.
S. Becker and G. E. Hinton, “Self-organizing neural network that discovers surfaces in random-dot stereograms,” Nature , vol. 355, no. 6356, pp. 161–163, 1992
1992
Earlier work this paper cites.
C. Zhu, R. H. Byrd, P. Lu, and J. Nocedal, “Algorithm 778: L-bfgs-b: Fortran subroutines for large-scale bound-constrained optimization,” ACM Transactions on Mathematical Software (TOMS) , vol. 23, no. 4, pp. 550–560, 1997
1997
Earlier work this paper cites.
T. M. Cover, Elements of information theory . John Wiley & Sons, 1999
1999
Earlier work this paper cites.
N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” arXiv preprint physics/0004057 , 2000
2000
Earlier work this paper cites.
H. G. Vogel, Drug discovery and evaluation: pharmacological assays . Springer Science & Business Media, 2002
2002
Earlier work this paper cites.
M. Belkin and P. Niyogi, “Laplacian eigenmaps for dimensionality reduction and data representation,” Neural computation , vol. 15, no. 6, pp. 1373–1396, 2003
2003
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.
R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin, “Liblinear: A library for large linear classification,” Journal of Machine Learning Research , vol. 9, pp. 1871–1874, 2008
2008
Earlier work this paper cites.
N. Shervashidze, P. Schweitzer, E. J. v. Leeuwen, K. Mehlhorn, and K. M. Borgwardt, “Weisfeiler-lehman graph kernels,” Journal of Machine Learning Research , vol. 12, no. Sep, pp. 2539–2561, 2011
2011
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, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay, “Scikit-learn: Machine learning in Python,” Journal of Machine Learning Research , vol. 12, pp. 2825–2830, 2011
2011
Earlier work this paper cites.
K. Henderson, B. Gallagher, T. Eliassi-Rad, H. Tong, S. Basu, L. Akoglu, D. Koutra, C. Faloutsos, and L. Li, “Rolx: structural role extraction & mining in large graphs,” in the ACM SIGKDD international conference on Knowledge discovery and data mining , 2012, pp. 1231–1239
2012
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory . John Wiley & Sons, 2012
2012
Earlier work this paper cites.
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 701–710
2014
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
2015
Earlier work this paper cites.
D. Duvenaud, D. Maclaurin, J. Aguilera-Iparraguirre, R. Gómez-Bombarelli, T. Hirzel, A. Aspuru-Guzik, and R. P. Adams, “Convolutional networks on graphs for learning molecular fingerprints,” Advances in Neural Information Processing Systems , vol. 2015, pp. 2224–2232, 2015
2015
Earlier work this paper cites.
P. Yanardag and S. Vishwanathan, “Deep graph kernels,” in Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining . ACM, 2015, pp. 1365–1374
2015
Earlier work this paper cites.
H. Dai, B. Dai, and L. Song, “Discriminative embeddings of latent variable models for structured data,” in International Conference on Machine Learning . PMLR, 2016, pp. 2702–2711
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” arXiv preprint arXiv:1611.07308 , 2016
2016
Earlier work this paper cites.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” in the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2016, pp. 855–864
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
W. L. Hamilton, R. Ying, and J. Leskovec, “Representation learning on graphs: Methods and applications,” IEEE Data Engineering Bulletin , vol. 40, no. 3, pp. 52–74, 2017
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in International Conference on Learning Representations , 2017
2017
Earlier work this paper cites.
L. F. Ribeiro, P. H. Saverese, and D. R. Figueiredo, “struc2vec: Learning node representations from structural identity,” in the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2017, pp. 385–394
2017
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Advances in Neural Information Processing Systems , 2017
2017
Cited alongside, same era.
I. Higgins, L. Matthey, A. Pal, C. Burgess, X. Glorot, M. Botvinick, S. Mohamed, and A. Lerchner, “beta-vae: Learning basic visual concepts with a constrained variational framework.” in International Conference on Learning Representations , 2017
2017
Cited alongside, same era.
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 . JMLR. org, 2017
2017
Cited alongside, same era.
C. J. Maddison, A. Mnih, and Y. W. Teh, “The concrete distribution: A continuous relaxation of discrete random variables,” in International Conference on Learning Representations , 2017
2017
Cited alongside, same era.
Z. Zhang, P. Cui, and W. Zhu, “Deep learning on graphs: A survey,” IEEE TKDE , 2020
2020
Later among the works it cites.
P. Li, Y. Wang, H. Wang, and J. Leskovec, “Distance encoding: Design provably more powerful neural networks for graph representation learning,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
W. Hu, B. Liu, J. Gomes, M. Zitnik, P. Liang, V. Pande, and J. Leskovec, “Strategies for pre-training graph neural networks,” International Conference on Learning Representations , 2020
2020
Later among the works it cites.
Z. Peng, W. Huang, M. Luo, Q. Zheng, Y. Rong, T. Xu, and J. Huang, “Graph representation learning via graphical mutual information maximization,” in Proceedings of The Web Conference 2020 , 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. Jang, S. Gu, and B. Poole, “Categorical reparameterization with gumbel-softmax,” in International Conference on Learning Representations , 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2017
Cited alongside, same era.
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
M. Zhang, Z. Cui, M. Neumann, and Y. Chen, “An end-to-end deep learning architecture for graph classification,” in the AAAI Conference on Artificial Intelligence , 2018, pp. 4438–4445
2018
Cited alongside, same era.
2018
Cited alongside, same era.
C. Donnat, M. Zitnik, D. Hallac, and J. Leskovec, “Learning structural node embeddings via diffusion wavelets,” in the ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2018, pp. 1320–1329
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2020
Later among the works it cites.
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
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
J. Qiu, Q. Chen, Y. Dong, J. Zhang, H. Yang, M. Ding, K. Wang, and J. Tang, “Gcc: Graph contrastive coding for graph neural network pre-training,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2020, pp. 1150–1160
2020
Later among the works it cites.
M. Tschannen, J. Djolonga, P. K. Rubenstein, S. Gelly, and M. Lucic, “On mutual information maximization for representation learning,” in International Conference on Learning Representations , 2020
2020
Later among the works it cites.
Z. Goldfeld and Y. Polyanskiy, “The information bottleneck problem and its applications in machine learning,” IEEE Journal on Selected Areas in Information Theory , 2020
2020
Later among the works it cites.
T. Wu, H. Ren, P. Li, and J. Leskovec, “Graph information bottleneck,” in Advances in Neural Information Processing Systems , 2020
2020
Later among the works it cites.
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,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
T. Chen, S. Kornblith, M. Norouzi, and G. Hinton, “A simple framework for contrastive learning of visual representations,” in International Conference on Machine Learning . PMLR, 2020, pp. 1597–1607
2020
Later among the works it cites.
O. Henaff, “Data-efficient image recognition with contrastive predictive coding,” in International Conference on Machine Learning . PMLR, 2020, pp. 4182–4192
2020
Later among the works it cites.
2020
Later among the works it cites.
Z. Peng, W. Huang, M. Luo, Q. Zheng, Y. Rong, T. Xu, and J. Huang, “Graph representation learning via graphical mutual information maximization,” in Proceedings of The Web Conference 2020 , 2020, pp. 259–270
2020
Later among the works it cites.
2020
Later among the works it cites.
Y. Tian, C. Sun, B. Poole, D. Krishnan, C. Schmid, and P. Isola, “What makes for good views for contrastive learning?” in Advances in Neural Information Processing Systems , 2020
2020
Later among the works it cites.
C. Morris, N. M. Kriege, F. Bause, K. Kersting, P. Mutzel, and M. Neumann, “Tudataset: A collection of benchmark datasets for learning with graphs,” in ICML 2020 Workshop on Graph Representation Learning and Beyond (GRL+ 2020) , 2020. [Online]. Available: www.graphlearning.io
2020
Later among the works it cites.
2020
Later among the works it cites.
N. M. Kriege, F. D. Johansson, and C. Morris, “A survey on graph kernels,” Applied Network Science , vol. 5, no. 1, pp. 1–42, 2020
2020
Later among the works it cites.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
J. Yu, T. Xu, Y. Rong, Y. Bian, J. Huang, and R. He, “Recognizing predictive substructures with subgraph information bottleneck,” International Conference on Learning Representations , 2021
2021
Closest in time.