Equivariant neural networks for recovery of Hadamard matrices
Not on the map. Why?
Abstract (arXiv)
We propose a message passing neural network architecture designed to be equivariant to column and row permutations of a matrix. We illustrate its advantages over traditional architectures like multi-layer perceptrons (MLPs), convolutional neural networks (CNNs) and even Transformers, on the combinatorial optimization task of recovering a set of deleted entries of a Hadamard matrix. We argue that this is a powerful application of the principles of Geometric Deep Learning to fundamental mathematics, and a potential stepping stone toward more insights on the Hadamard conjecture using Machine Learning techniques.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 11 of its 27 references that are in the map. First posted on arXiv 31 Jan 2022.
Builds on
11 of 27 references.
References · 11
- 2017Attention Is All You Needcited by 59,932
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2017Deep Setscited by 1,394
- 2016Group Equivariant Convolutional Networkscited by 1,154
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
- 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
- 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
- 2018On the Generalization of Equivariance and Convolution in Neural Networks to the Action of Compact Groupscited by 296
- 2017Equivariance Through Parameter-Sharingcited by 139
- 2019Exploratory Combinatorial Optimization with Reinforcement Learningcited by 82
- 2020The general theory of permutation equivarant neural networks and higher order graph variational encoderscited by 28
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Generating Hadamard matrices with transformerscited by 0
- 2026Generating Hadamard matrices with transformers13 Apr 2026