Models and Benchmarks for Representation Learning of Partially Observed Subgraphs
Not on the map. Why?
Abstract (arXiv)
Subgraphs are rich substructures in graphs, and their nodes and edges can be partially observed in real-world tasks. Under partial observation, existing node- or subgraph-level message-passing produces suboptimal representations. In this paper, we formulate a novel task of learning representations of partially observed subgraphs. To solve this problem, we propose Partial Subgraph InfoMax (PSI) framework and generalize existing InfoMax models, including DGI, InfoGraph, MVGRL, and GraphCL, into our framework. These models maximize the mutual information between the partial subgraph's summary and various substructures from nodes to full subgraphs. In addition, we suggest a novel two-stage model with k-hop PSI, which reconstructs the representation of the full subgraph and improves its expressiveness from different local-global structures. Under training and evaluation protocols designed for this problem, we conduct experiments on three real-world datasets and demonstrate that PSI models outperform baselines.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 51 of its 66 references that are in the map. First posted on arXiv 1 Sep 2022.
Builds on
51 of 66 references.
References · 51
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2018Relational inductive biases, deep learning, and graph networkscited by 1,341
38 more
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
- 2020Graph Contrastive Learning with Augmentationscited by 1,203
- 2018Deep Graph Infomaxcited by 1,101
- 2016Geometric deep learning: going beyond Euclidean datacited by 1,042
- 2018Link Prediction Based on Graph Neural Networkscited by 829
- 2015Gated Graph Sequence Neural Networkscited by 792
- 2019GNNExplainer: Generating Explanations for Graph Neural Networkscited by 735
- 2020Self-supervised Learning: Generative or Contrastivecited by 693
- 2018MINE: Mutual Information Neural Estimationcited by 680
- 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
- 2020Benchmarking Graph Neural Networkscited by 672
- 2020Contrastive Multi-View Representation Learning on Graphscited by 651
- 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
- 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 540
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 504
- 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 461
- 2015Deep Metric Learning via Lifted Structured Feature Embeddingcited by 449
- 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
- 2020Keystroke Dynamics as Part of Lifeloggingcited by 334
- 2019On Mutual Information Maximization for Representation Learningcited by 315
- 2016Learning Convolutional Neural Networks for Graphscited by 314
- 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 312
- 2019Inductive Relation Prediction by Subgraph Reasoningcited by 237
- 2020Graph Representation Learning via Graphical Mutual Information Maximizationcited by 217
- 2019Local Aggregation for Unsupervised Learning of Visual Embeddingscited by 204
- 2020Rumor Detection on Social Media with Bi-Directional Graph Convolutional Networkscited by 152
- 2020Graph Information Bottleneck for Subgraph Recognitioncited by 119
- 2021An Empirical Study of Graph Contrastive Learningcited by 113
- 2019Unsupervised Attributed Multiplex Network Embeddingcited by 95
- 2020Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learningcited by 90
- 2020Graph Meta Learning via Local Subgraphscited by 89
- 2021HDMI: High-order Deep Multiplex Infomaxcited by 82
- 2021SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanismcited by 75
- 2020Subgraph Neural Networkscited by 73
- 2020Conditional Negative Sampling for Contrastive Learning of Visual Representationscited by 57
- 2014Question Answering with Subgraph Embeddingscited by 56
- 2020Graph Cross Networks with Vertex Infomax Poolingcited by 31
- 2020Bipartite Graph Embedding via Mutual Information Maximizationcited by 29
50 most cited of 51 All 51 (JSON)
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.
- 2025Incomplete Graph Learning: A Comprehensive Surveycited by 3
- 2024Generalizing Weisfeiler-Lehman Kernels to Subgraphscited by 1
- 2025Incomplete Graph Learning: A Comprehensive Survey18 Feb 2025
- 2024Generalizing Weisfeiler-Lehman Kernels to Subgraphs3 Dec 2024