Fetching the paper…
Reading the bibliography…
In general, graph representation learning methods assume that the train and test data come from the same distribution.
Sur les applications de la theorie des probabilites aux experiences agricoles: essai des principes (masters thesis); justification of applications of the calculus of probabilities to the solutions of certain questions in agricultural experimentation. excerpts english translation (reprinted)
Neyman, J · 1923
Earlier work this paper cites.
Inverse statistical variates
Tweedie, M. C · 1945
Earlier work this paper cites.
A congruence theorem for trees
Kelly, P. J. et al · 1957
Earlier work this paper cites.
On random graphs i
Erdős, P. and Rényi, A · 1959
Earlier work this paper cites.
Random graphs
Gilbert, E. N · 1959
Earlier work this paper cites.
A collection of mathematical problems
Ulam, S. M · 1960
Earlier work this paper cites.
On reconstructing a graph
Hemminger, R. L · 1969
Earlier work this paper cites.
Estimating causal effects of treatments in randomized and nonrandomized studies
Rubin, D. B · 1974
Earlier work this paper cites.
Relations on probability spaces and arrays of random variables
Hoover, D. N · 1979
Earlier work this paper cites.
Representations for partially exchangeable arrays of random variables
Aldous, D. J · 1981
Earlier work this paper cites.
On the statistics of vision: the julesz conjecture
Diaconis, P. and Freedman, D · 1981
Earlier work this paper cites.
Competitive exclusion, or species aggregation?
Stone, L. and Roberts, A · 1992
Earlier work this paper cites.
Causal forces: Structuring knowledge for time-series extrapolation
Scott Armstrong, J. and Collopy, F · 1993
Earlier work this paper cites.
Probabilistic evaluation of counterfactual queries
Balke, A. and Pearl, J · 1994
Earlier work this paper cites.
Small graphs are reconstructible
McKay, B. D · 1997
Earlier work this paper cites.
Estimation and prediction for stochastic blockmodels for graphs with latent block structure
Snijders, T. A. and Nowicki, K · 1997
Earlier work this paper cites.
Causal discovery from changes
Tian, J. and Pearl, J · 2001
Earlier work this paper cites.
Laplacian eigenmaps and spectral techniques for embedding and clustering
Belkin, M. and Niyogi, P · 2002
Earlier work this paper cites.
Escaping the convex hull with extrapolated vector machines
Haffner, P · 2002
Earlier work this paper cites.
Network motifs: simple building blocks of complex networks
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., and Alon, U · 2002
Earlier work this paper cites.
Network motifs in the transcriptional regulation network of escherichia coli
Shen-Orr, S. S., Milo, R., Mangan, S., and Alon, U · 2002
Earlier work this paper cites.
On graph kernels: Hardness results and efficient alternatives
Gärtner, T., Flach, P., and Wrobel, S · 2003
Earlier work this paper cites.
Marginalized kernels between labeled graphs
Kashima, H., Tsuda, K., and Inokuchi, A · 2003
Earlier work this paper cites.
Structure and function of the feed-forward loop network motif
Mangan, S. and Alon, U · 2003
Earlier work this paper cites.
Motifs in brain networks
Sporns, O. and Kötter, R · 2004
Earlier work this paper cites.
Decomposition by causal forces: a procedure for forecasting complex time series
Armstrong, J. S., Collopy, F., and Yokum, J. T · 2005
Earlier work this paper cites.
Simple trophic modules for complex food webs
Bascompte, J. and Melián, C. J · 2005
Earlier work this paper cites.
Shortest-path kernels on graphs
Borgwardt, K. M. and Kriegel, H.-P · 2005
Earlier work this paper cites.
Protein function prediction via graph kernels
Borgwardt, K. M., Ong, C. S., Schönauer, S., Vishwanathan, S., Smola, A. J., and Kriegel, H.-P · 2005
Earlier work this paper cites.
Mapping complex tissue architecture with diffusion spectrum magnetic resonance imaging
Wedeen, V. J., Hagmann, P., Tseng, W.-Y. I., Reese, T. G., and Weisskoff, R. M · 2005
Earlier work this paper cites.
Probabilistic symmetries and invariance principles
Kallenberg, O · 2006
Earlier work this paper cites.
The dangers of extreme counterfactuals
King, G. and Zeng, L · 2006
Earlier work this paper cites.
Limits of dense graph sequences
Lovász, L. and Szegedy, B · 2006
Earlier work this paper cites.
Network motifs: theory and experimental approaches
Alon, U · 2007
Earlier work this paper cites.
Mapping human whole-brain structural networks with diffusion mri
Hagmann, P., Kurant, M., Gigandet, X., Thiran, P., Wedeen, V. J., Meuli, R., and Thiran, J.-P · 2007
Earlier work this paper cites.
Biological network comparison using graphlet degree distribution
Pržulj, N · 2007
Earlier work this paper cites.
Covariate shift adaptation by importance weighted cross validation
Sugiyama, M., Krauledat, M., and Müller, K.-R · 2007
Earlier work this paper cites.
Exploring network structure, dynamics, and function using networkx
Hagberg, A. A., Schult, D. A., and Swart, P. J · 2008
Earlier work this paper cites.
Comparison of descriptor spaces for chemical compound retrieval and classification
Wale, N., Watson, I. A., and Karypis, G · 2008
Earlier work this paper cites.
Causality
Pearl, J · 2009
Earlier work this paper cites.
Efficient graphlet kernels for large graph comparison
Shervashidze, N., Vishwanathan, S., Petri, T., Mehlhorn, K., and Borgwardt, K · 2009
Earlier work this paper cites.
Graphcrop: Subgraph cropping for graph classification
Wang, Y., Wang, W., Liang, Y., Cai, Y., and Hooi, B · 2009
Earlier work this paper cites.
Scikit-learn: Machine learning in Python
Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., and Duchesnay, E · 2011
Earlier work this paper cites.
Weisfeiler-lehman graph kernels
Shervashidze, N., Schweitzer, P., Leeuwen, E. J. v., Mehlhorn, K., and Borgwardt, K. M · 2011
Earlier work this paper cites.
The elements of statistical learning , volume 1
Hastie, T., Tibshirani, R., and Friedman, J · 2012
Earlier work this paper cites.
Large networks and graph limits , volume 60
Lovász, L · 2012
Earlier work this paper cites.
Stochastic blockmodel approximation of a graphon: Theory and consistent estimation
Airoldi, E. M., Costa, T. B., and Chan, S. H · 2013
Earlier work this paper cites.
Identification of breast cancer patients based on human signaling network motifs
Chen, L., Qu, X., Cao, M., Zhou, Y., Li, W., Liang, B., Li, W., He, W., Feng, C., Jia, X., et al · 2013
Earlier work this paper cites.
Bayesian models of graphs, arrays and other exchangeable random structures
Orbanz, P. and Roy, D. M · 2014
Earlier work this paper cites.
Deepwalk: Online learning of social representations
Perozzi, B., Al-Rfou, R., and Skiena, S · 2014
Earlier work this paper cites.
Efficiently estimating motif statistics of large networks
Wang, P., Lui, J. C., Ribeiro, B., Towsley, D., Zhao, J., and Guan, X · 2014
Earlier work this paper cites.
Convolutional networks on graphs for learning molecular fingerprints
Duvenaud, D. K., Maclaurin, D., Iparraguirre, J., Bombarell, R., Hirzel, T., Aspuru-Guzik, A., and Adams, R. P · 2015
Earlier work this paper cites.
Explaining and harnessing adversarial examples
Goodfellow, I. J., Shlens, J., and Szegedy, C · 2015
Cited alongside, same era.
Telling cause from effect in deterministic linear dynamical systems
Shajarisales, N., Janzing, D., Schoelkopf, B., and Besserve, M · 2015
Cited alongside, same era.
Deep graph kernels
Yanardag, P. and Vishwanathan, S · 2015
Cited alongside, same era.
Estimation of local subgraph counts
Ahmed, N. K., Willke, T. L., and Rossi, R. A · 2016
Cited alongside, same era.
Diffusion-convolutional neural networks
Atwood, J. and Towsley, D · 2016
Cited alongside, same era.
Interaction networks for learning about objects, relations and physics
Battaglia, P., Pascanu, R., Lai, M., Rezende, D. J., et al · 2016
Cited alongside, same era.
Predicting dynamic embedding trajectory in temporal interaction networks
Kumar, S., Zhang, X., and Leskovec, J · 2019
Later among the works it cites.
Hyperbolic graph neural networks
Liu, Q., Nickel, M., and Kiela, D · 2019
Later among the works it cites.
Challenging common assumptions in the unsupervised learning of disentangled representations
Locatello, F., Bauer, S., Lucic, M., Raetsch, G., Gelly, S., Schölkopf, B., and Bachem, O · 2019
Later among the works it cites.
Weisfeiler and leman go neural: Higher-order graph neural networks
Morris, C., Ritzert, M., Fey, M., Hamilton, W. L., Lenssen, J. E., Rattan, G., and Grohe, M · 2019
Later among the works it cites.
Relational pooling for graph representations
Murphy, R., Srinivasan, B., Rao, V., and Ribeiro, B · 2019
Later among the works it cites.
Pytorch: An imperative style, high-performance deep learning library
Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., Desmaison, A., Kopf, A., Yang, E., DeVito, Z., Raison, M., Tejani, A., Chilamkurthy, S., Steiner, B., Fang, L., Bai, J., and Chintala, S · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Higher-order organization of complex networks
Benson, A. R., Gleich, D. F., and Leskovec, J · 2016
Cited alongside, same era.
A general framework for estimating graphlet statistics via random walk
Chen, X., Li, Y., Wang, P., and Lui, J · 2016
Cited alongside, same era.
Mapping multiplex hubs in human functional brain networks
De Domenico, M., Sasai, S., and Arenas, A · 2016
Cited alongside, same era.
Design and analysis of experiments in networks: Reducing bias from interference
Eckles, D., Karrer, B., and Ugander, J · 2016
Cited alongside, same era.
node2vec: Scalable feature learning for networks
Grover, A. and Leskovec, J · 2016
Cited alongside, same era.
Learning representations for counterfactual inference
Johansson, F., Shalit, U., and Sontag, D · 2016
Cited alongside, same era.
Later among the works it cites.
A persistent weisfeiler-lehman procedure for graph classification
Rieck, B., Bock, C., and Borgwardt, K · 2019
Later among the works it cites.
Rossi, R. A., Ahmed, N. K., Carranza, A., Arbour, D., Rao, A., Kim, S., and Koh, E · 2019
Later among the works it cites.
Analysing mathematical reasoning abilities of neural models
Saxton, D., Grefenstette, E., Hill, F., and Kohli, P · 2019
Later among the works it cites.
Causality for machine learning
Schölkopf, B · 2019
Later among the works it cites.
Network motifs and their origins
Stone, L., Simberloff, D., and Artzy-Randrup, Y · 2019
Later among the works it cites.
How powerful are graph neural networks?
Xu, K., Hu, W., Leskovec, J., and Jegelka, S · 2019
Later among the works it cites.
Position-aware graph neural networks
You, J., Ying, R., and Leskovec, J · 2019
Later among the works it cites.
On weisfeiler-leman invariance: subgraph counts and related graph properties
Arvind, V., Fuhlbrück, F., Köbler, J., and Verbitsky, O · 2020
Later among the works it cites.
A meta-transfer objective for learning to disentangle causal mechanisms
Bengio, Y., Deleu, T., Rahaman, N., Ke, N. R., Lachapelle, S., Bilaniuk, O., Goyal, A., and Pal, C · 2020
Later among the works it cites.
Improving graph neural network expressivity via subgraph isomorphism counting
Bouritsas, G., Frasca, F., Zafeiriou, S., and Bronstein, M. M · 2020
Later among the works it cites.
Machine learning on graphs: A model and comprehensive taxonomy
Chami, I., Abu-El-Haija, S., Perozzi, B., Ré, C., and Murphy, K · 2020
Later among the works it cites.
Can graph neural networks count substructures?
Chen, Z., Chen, L., Villar, S., and Bruna, J · 2020
Later among the works it cites.
Estimating generalization under distribution shifts via domain-invariant representations, 2020
Chuang, C.-Y., Torralba, A., and Jegelka, S · 2020
Later among the works it cites.
Principal neighbourhood aggregation for graph nets
Corso, G., Cavalleri, L., Beaini, D., Lio, P., and Veličković, P · 2020
Later among the works it cites.
Underspecification presents challenges for credibility in modern machine learning
D’Amour, A., Heller, K., Moldovan, D., Adlam, B., Alipanahi, B., Beutel, A., Chen, C., Deaton, J., Eisenstein, J., Hoffman, M. D., et al · 2020
Later among the works it cites.
Generalization and representational limits of graph neural networks
Garg, V. K., Jegelka, S., and Jaakkola, T · 2020
Later among the works it cites.
Shortcut learning in deep neural networks
Geirhos, R., Jacobsen, J.-H., Michaelis, C., Zemel, R., Brendel, W., Bethge, M., and Wichmann, F. A · 2020
Later among the works it cites.
Graph representation learning
Hamilton, W. L · 2020
Later among the works it cites.
Survey on categorical data for neural networks
Hancock, J. T. and Khoshgoftaar, T. M · 2020
Later among the works it cites.
Open graph benchmark: Datasets for machine learning on graphs
Hu, W., Fey, M., Zitnik, M., Dong, Y., Ren, H., Liu, B., Catasta, M., and Leskovec, J · 2020
Later among the works it cites.
Learning tsp requires rethinking generalization
Joshi, C. K., Cappart, Q., Rousseau, L.-M., Laurent, T., and Bresson, X · 2020
Later among the works it cites.
Representation learning for dynamic graphs: A survey
Kazemi, S. M., Goel, R., Jain, K., Kobyzev, I., Sethi, A., Forsyth, P., and Poupart, P · 2020
Later among the works it cites.
Directional message passing for molecular graphs
Klicpera, J., Groß, J., and Günnemann, S · 2020
Later among the works it cites.
Wilds: A benchmark of in-the-wild distribution shifts
Koh, P. W., Sagawa, S., Marklund, H., Xie, S. M., Zhang, M., Balsubramani, A., Hu, W., Yasunaga, M., Phillips, R. L., Beery, S., et al · 2020
Later among the works it cites.
A survey on graph kernels
Kriege, N. M., Johansson, F. D., and Morris, C · 2020
Later among the works it cites.
Deep learning for symbolic mathematics
Lample, G. and Charton, F · 2020
Later among the works it cites.
Representation learning of graphs using graph convolutional multilayer networks based on motifs
Li, X., Wei, W., Feng, X., Liu, X., and Zheng, Z · 2020
Later among the works it cites.
Tudataset: A collection of benchmark datasets for learning with graphs
Morris, C., Kriege, N. M., Bause, F., Kersting, K., Mutzel, P., and Neumann, M · 2020
Later among the works it cites.
Causal feature selection via orthogonal search
Raj, A., Bauer, S., Soleymani, A., Besserve, M., and Schölkopf, B · 2020
Later among the works it cites.
The risks of invariant risk minimization
Rosenfeld, E., Ravikumar, P., and Risteski, A · 2020
Later among the works it cites.
A survey on the expressive power of graph neural networks
Sato, R · 2020
Later among the works it cites.
Towards scale-invariant graph-related problem solving by iterative homogeneous gnns
Tang, H., Huang, Z., Gu, J., Lu, B.-L., and Su, H · 2020
Later among the works it cites.
Inductive relation prediction by subgraph reasoning
Teru, K. K., Denis, E., and Hamilton, W. L · 2020
Later among the works it cites.
Neural execution of graph algorithms
Veličković, P., Ying, R., Padovano, M., Hadsell, R., and Blundell, C · 2020
Later among the works it cites.
Building powerful and equivariant graph neural networks with structural message-passing
Vignac, C., Loukas, A., and Frossard, P · 2020
Later among the works it cites.
A comprehensive survey on graph neural networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., and Philip, S. Y · 2020
Later among the works it cites.
Deepmap: Learning deep representations for graph classification
Ye, W., Askarisichani, O., Jones, A., and Singh, A · 2020
Later among the works it cites.
Deep learning on graphs: A survey
Zhang, Z., Cui, P., and Zhu, W · 2020
Later among the works it cites.
Incremental learning on growing graphs
Anonymous · 2021
Closest in time.
On the equivalence between temporal and static graph representations for observational predictions
Gao, J. and Ribeiro, B · 2021
Closest in time.
Out-of-distribution generalization via risk extrapolation (rex), 2021
Krueger, D., Caballero, E., Jacobsen, J.-H., Zhang, A., Binas, J., Zhang, D., Priol, R. L., and Courville, A · 2021
Closest in time.
Neural networks for learning counterfactual g-invariances from single environments
Mouli, S. C. and Ribeiro, B · 2021
Closest in time.
Graph learning with 1d convolutions on random walks
Toenshoff, J., Ritzert, M., Wolf, H., and Grohe, M · 2021
Closest in time.
How neural networks extrapolate: From feedforward to graph neural networks
Xu, K., Zhang, M., Li, J., Du, S. S., Kawarabayashi, K.-I., and Jegelka, S · 2021
Closest in time.
From local structures to size generalization in graph neural networks
Yehudai, G., Fetaya, E., Meirom, E., Chechik, G., and Maron, H · 2021
Closest in time.