The Role of Fibration Symmetries in Geometric Deep Learning
Not on the map. Why?
Abstract (arXiv)
Geometric Deep Learning (GDL) unifies a broad class of machine learning techniques from the perspectives of symmetries, offering a framework for introducing problem-specific inductive biases like Graph Neural Networks (GNNs). However, the current formulation of GDL is limited to global symmetries that are not often found in real-world problems. We propose to relax GDL to allow for local symmetries, specifically fibration symmetries in graphs, to leverage regularities of realistic instances. We show that GNNs apply the inductive bias of fibration symmetries and derive a tighter upper bound for their expressive power. Additionally, by identifying symmetries in networks, we collapse network nodes, thereby increasing their computational efficiency during both inference and training of deep neural networks. The mathematical extension introduced here applies beyond graphs to manifolds, bundles, and grids for the development of models with inductive biases induced by local symmetries that can lead to better generalization.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 25 of its 58 references that are in the map. First posted on arXiv 28 Aug 2024.
Builds on
25 of 58 references.
References · 25
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,576
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,167
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
- 2018Deep Learning for Classical Japanese Literaturecited by 422
- 2021A Survey of Transformerscited by 401
- 2020Improving Graph Neural Network Expressivity via Subgraph Isomorphism Countingcited by 313
- 2022Neural Collapse: A Review on Modelling Principles and Generalizationcited by 95
- 2015Reducing Overfitting in Deep Networks by Decorrelating Representationscited by 94
- 2022Theory of Graph Neural Networks: Representation and Learningcited by 61
- 2019GraphZoom: A multi-level spectral approach for accurate and scalable graph embeddingcited by 58
13 more
- 2021Autobahn: Automorphism-based Graph Neural Netscited by 39
- 2023Stochastic Collapse: How Gradient Noise Attracts SGD Dynamics Towards Simpler Subnetworkscited by 39
- 2020Natural Graph Networkscited by 35
- 2018MILE: A Multi-Level Framework for Scalable Graph Embeddingcited by 28
- 2018Lov'asz Meets Weisfeiler and Lemancited by 27
- 2023The Expressive Power of Graph Neural Networks: A Surveycited by 27
- 2022Symmetry-Based Representations for Artificial and Biological General Intelligencecited by 26
- 2023Approximately Equivariant Graph Networkscited by 16
- 2024Low-Rank Learning by Design: the Role of Network Architecture and Activation Linearity in Gradient Rank Collapsecited by 5
- 2013Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex Networkscited by 4
- 2023Learning Graph Neural Networks using Exact Compressioncited by 3
- 2020Improving Expressivity of Graph Neural Networkscited by 2
- 2013Modular dynamical systems on networkscited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.