Tensor learning with orthogonal, Lorentz, and symplectic symmetries
Wilson G. Gregory, Josué Tonelli-Cueto, Nicholas F. Marshall, Andrew S. Lee, Soledad Villar
TL;DR
This work develops a generic, mathematically principled framework for learning tensor-valued maps that are equivariant under diagonal actions of classical groups, including $O(d)$, the Lorentz group $O(s,d-s)$, and the symplectic group $Sp(d)$. By parameterizing equivariant tensor maps through contractions with $G$-isotropic tensors and, in the vector-input case, via invariant inner products, the authors avoid Clebsch–Gordan coefficients and achieve universal expressivity for tensor polynomials and entire functions. They prove a general theorem characterizing all $G$-equivariant tensor polynomials and extend it to indefinite and symplectic groups, providing concrete corollaries for vector-to-tensor mappings and symmetric-matrix cases. The framework is validated across materials science, time-series analysis, and sparse-vector estimation, where the equivariant models consistently outperform non-equivariant baselines and, in some settings, SoS-based methods. The approach offers a scalable, principled pathway to incorporate symmetry into ML models for physics-informed and geometry-aware tensor problems, with reproducible code and datasets.
Abstract
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.
