Relational Pooling for Graph Representations
This work generalizes graph neural networks (GNNs) beyond those based on the Weisfeiler-Lehman (WL) algorithm, graph Laplacians, and diffusions. Our approach, denoted Relational Pooling (RP), draws from the theory of finite partial exchangeability to provide a framework with maximal representation power for graphs. RP can work with existing graph representation models and, somewhat counterintuitively, can make them even more powerful than the original WL isomorphism test. Additionally, RP allows architectures like Recurrent Neural Networks and Convolutional Neural Networks to be used in a theoretically sound approach for graph classification. We demonstrate improved performance of RP-based graph representations over state-of-the-art methods on a number of tasks.
Code (1)
Tasks
General ClassificationGraph ClassificationSimilar Papers 제목 키워드 기반
Towards Improved Sentence Representations using Token Graphs
Obtaining a single-vector representation from a Large Language Model's (LLM) token-level outputs is a critical step for nearly all sentence-level tasks. However, standard pooling methods like mean or max aggregation trea…
parameter-efficient fine-tuningGraph Neural NetworkRelational Reasoning Over Spatial-Temporal Graphs for Video Summarization
In this paper, we propose a dynamic graph modeling approach to learn spatial-temporal representations for video summarization. Most existing video summarization methods extract image-level features with ImageNet pre-trai…
Graph ClassificationRelationRelational ReasoningSupervised Video Summarization+1Fully Convolutional Graph Neural Networks using Bipartite Graph Convolutions
Graph neural networks have been adopted in numerous applications ranging from learning relational representations to modeling data on irregular domains such as point clouds, social graphs, and molecular structures. Thoug…
Graph Neural NetworkAutoSchA: Automatic Hierarchical Music Representations via Multi-Relational Node Isolation
Hierarchical representations provide powerful and principled approaches for analyzing many musical genres. Such representations have been broadly studied in music theory, for instance via Schenkerian analysis (SchA). Hie…
Graph LearningSecond-Order Pooling for Graph Neural Networks
Graph neural networks have achieved great success in learning node representations for graph tasks such as node classification and link prediction. Graph representation learning requires graph pooling to obtain graph rep…
Graph ClassificationGraph Representation LearningLink PredictionNode Classification+1