Graph Filtration Learning
arXiv:1905.10996
Abstract
We propose an approach to learning with graph-structured data in the problem domain of graph classification. In particular, we present a novel type of readout operation to aggregate node features into a graph-level representation. To this end, we leverage persistent homology computed via a real-valued, learnable, filter function. We establish the theoretical foundation for differentiating through the persistent homology computation. Empirically, we show that this type of readout operation compares favorably to previous techniques, especially when the graph connectivity structure is informative for the learning problem.
References in corpus (8)
- Inductive Representation Learning on Large Graphs
- Neural Message Passing for Quantum Chemistry
- Representation Learning on Graphs with Jumping Knowledge Networks
- Neural Persistence: A Complexity Measure for Deep Neural Networks Using Algebraic Topology
- Learning metrics for persistence-based summaries and applications for graph classification
- A Topological Regularizer for Classifiers via Persistent Homology
- RetGK: Graph Kernels based on Return Probabilities of Random Walks
- Connectivity-Optimized Representation Learning via Persistent Homology