Tensor learning with orthogonal, Lorentz, and symplectic symmetries
Not on the map. Why?
Abstract (arXiv)
Tensors are a fundamental data structure for many scientific contexts, such as time series analysis, materials science, and physics, among many others. Improving our ability to produce and handle tensors is essential to efficiently address problems in these domains. In this paper, we show how to exploit the underlying symmetries of functions that map tensors to tensors. More concretely, we develop universally expressive equivariant machine learning architectures on tensors that exploit that, in many cases, these tensor functions are equivariant with respect to the diagonal action of the orthogonal, Lorentz, and/or symplectic groups. We showcase our results on three problems coming from material science, theoretical computer science, and time series analysis. For time series, we combine our method with the increasingly popular path signatures approach, which is also invariant with respect to reparameterizations. Our numerical experiments show that our equivariant models perform better than corresponding non-equivariant baselines.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 44 of its 74 references that are in the map. First posted on arXiv 3 Jun 2024.
Builds on
44 of 74 references.
References · 44
- 2016Group Equivariant Convolutional Networkscited by 1,154
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
- 2020SE(3)-Transformers: 3D Roto-Translation Equivariant Attention Networkscited by 602
- 2018Spherical CNNscited by 452
- 2019General E(2)-Equivariant Steerable CNNscited by 441
- 20183D Steerable CNNs: Learning Rotationally Equivariant Features in Volumetric Datacited by 348
- 2018Invariant and Equivariant Graph Networkscited by 339
- 2021Vector Neurons: A General Framework for SO(3)-Equivariant Networkscited by 304
- 2016Steerable CNNscited by 298
- 2021A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groupscited by 185
- 2022e3nn: Euclidean Neural Networkscited by 171
- 2018Universal approximations of invariant maps by neural networkscited by 127
32 more
- 2021Scalars are universal: Equivariant machine learning, structured like classical physicscited by 127
- 2020Incorporating Symmetry into Deep Dynamics Models for Improved Generalizationcited by 123
- 2022Equivariance with Learned Canonicalization Functionscited by 106
- 2019Deep Signature Transformscited by 75
- 2014A statistical model for tensor PCAcited by 72
- 2021Coordinate Independent Convolutional Networks -- Isometry and Gauge Equivariant Convolutions on Riemannian Manifoldscited by 72
- 2020Certified Robustness of Graph Neural Networks against Adversarial Structural Perturbationcited by 57
- 2023Graph Metanetworks for Processing Diverse Neural Architecturescited by 55
- 2018Signature moments to characterize laws of stochastic processescited by 54
- 2023TensorNet: Cartesian Tensor Representations for Efficient Learning of Molecular Potentialscited by 53
- 2017Introduction to Tensor Decompositions and their Applications in Machine Learningcited by 45
- 2023Approximation-Generalization Trade-offs under (Approximate) Group Equivariancecited by 45
- 2018N-body Networks: a Covariant Hierarchical Neural Network Architecture for Learning Atomic Potentialscited by 42
- 2015Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectorscited by 38
- 2021Provably Strict Generalisation Benefit for Invariance in Kernel Methodscited by 29
- 2023The Exact Sample Complexity Gain from Invariances for Kernel Regressioncited by 27
- 2016A note on the sample complexity of the Er-SpUD algorithm by Spielman, Wang and Wright for exact recovery of sparsely used dictionariescited by 26
- 2021Noether Networks: Meta-Learning Useful Conserved Quantitiescited by 26
- 2023Structuring Representation Geometry with Rotationally Equivariant Contrastive Learningcited by 24
- 2021Optimal Spectral Recovery of a Planted Vector in a Subspacecited by 21
- 2022Brauer's Group Equivariant Neural Networkscited by 17
- 2022Dimensionless machine learning: Imposing exact units equivariancecited by 16
- 2023Approximately Equivariant Graph Networkscited by 16
- 2020Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applicationscited by 13
- 2022Machine learning and invariant theorycited by 13
- 2023Towards fully covariant machine learningcited by 10
- 2024Tensor cumulants for statistical inference on invariant distributionscited by 8
- 2024A Galois theorem for machine learning: Functions on symmetric matrices and point clouds via lightweight invariant featurescited by 6
- 2023Symmetry-enforcing neural networks with applications to constitutive modelingcited by 4
- 2018Learning Paths from Signature Tensorscited by 2
- 2023DUET: 2D Structured and Approximately Equivariant Representationscited by 2
- 2023Shortest-path recovery from signature with an optimal control approachcited by 1
Built on by
Citing papers per year: 2025: 3.
3 papers.