Efficient generation and explicit dimensionality of Lie group-equivariant and permutation-invariant bases

• URL: http://arxiv.org/abs/2604.01975v1
• Date: Thu, 02 Apr 2026 12:33:33 GMT
• Title: Efficient generation and explicit dimensionality of Lie group-equivariant and permutation-invariant bases
• Abstract summary: We propose a practical construction of Lie group-equivariant and permutation-invariant functions of $N$ variables.<n>The construction is generic for any linear Lie group and relies on building a matrix constructed from the Lie algebra.<n>We show that for large values of $N$, the number of rotation-equivariant and permutation-invariant basis functions is of a comparable order.
• Score: 1.6789611055085498
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this article, we propose a practical construction of Lie group-equivariant and permutation-invariant functions of $N$ variables from the knowledge of a one-particle basis that is stable with respect to the group action. The construction is generic for any linear Lie group and relies on building a matrix constructed from the Lie algebra whose kernel is spanned by a group-equivariant and permutation-invariant basis. In particular, this construction does not require the knowledge of Clebsch--Gordan coefficients and instead directly builds generalized Clebsch--Gordan coefficients. For specific groups such as $SO(3)$ and $SU(2)$, we exploit the Lie algebra structure to simplify the matrix, which then allows us to derive an explicit formula for the exact dimension of the group-equivariant and permutation-invariant space. Numerical simulations are provided to show that the proposed method scales linearly instead of exponentially for existing methods in the literature. We also show that for large values of $N$, the number of rotation-equivariant and permutation-invariant basis functions is of a comparable order as the number of permutation-invariant basis functions, while pre-asymptotically, a large gain can be achieved by explicitly enforcing rotation-equivariance on top of permutation-invariance.

Related papers

• Any-Subgroup Equivariant Networks via Symmetry Breaking [47.72921214239821]
  equivariant architectures are usually highly constrained, designed for symmetries chosen a priori.<n>This precludes the development of flexible, multi-modal foundation models capable of processing diverse data equivariantly.<n>We build a single model that can be simultaneously equivariant to several groups, simply by modulating a certain auxiliary input feature.
  arXiv  Detail & Related papers  (2026-03-19T21:30:41Z)
• On Counts and Densities of Homogeneous Bent Functions: An Evolutionary Approach [60.00535100780336]
  This paper examines the use of Evolutionary Algorithms (EAs) to evolve homogeneous bent Boolean functions.<n>We introduce the notion of density of homogeneous bent functions, facilitating the algorithmic design that results in finding quadratic and cubic bent functions in different numbers of variables.
  arXiv  Detail & Related papers  (2025-11-16T15:33:40Z)
• Learning Equivariant Functions via Quadratic Forms [7.771878859878091]
  We introduce a method for learning group (known or unknown) equivariant functions by learning the associated quadratic form $xT A x$ corresponding to the group from the data.<n>We utilize the corresponding unique symmetric matrix and its inherent diagonal form, leading to models that are both simplified and efficient.
  arXiv  Detail & Related papers  (2025-09-26T10:44:26Z)
• Knowledge Graph Embedding by Normalizing Flows [26.732799849307316]
  Key to knowledge graph embedding (KGE) is to choose a proper representation space, e.g., point-wise Euclidean space and complex vector space. We propose a unified perspective of embedding and introduce uncertainty into KGE from the view of group theory.
  arXiv  Detail & Related papers  (2024-09-30T06:04:34Z)
• A Galois theorem for machine learning: Functions on symmetric matrices and point clouds via lightweight invariant features [26.619014249559942]
  We present a mathematical formulation for machine learning of functions on symmetric matrices and point clouds.<n>We provide a general construction of generically separating invariant features using ideas inspired by Galois theory.<n>We prove that the number of invariant features can be reduced, generically without losing expressivity, to $O(n)$, where $n$ is the number of points.
  arXiv  Detail & Related papers  (2024-05-13T18:24:03Z)
• Lie Group Decompositions for Equivariant Neural Networks [12.139222986297261]
  We show how convolution kernels can be parametrized to build models equivariant with respect to affine transformations. We evaluate the robustness and out-of-distribution generalisation capability of our model on the benchmark affine-invariant classification task.
  arXiv  Detail & Related papers  (2023-10-17T16:04:33Z)
• Geometry of Linear Neural Networks: Equivariance and Invariance under Permutation Groups [1.8434042562191815]
  We investigate the subvariety of functions that are equivariant or invariant under the action of a permutation group.<n>We draw conclusions for the parameterization and the design of equivariant and invariant linear networks.
  arXiv  Detail & Related papers  (2023-09-24T19:40:15Z)
• Fast computation of permutation equivariant layers with the partition algebra [0.0]
  Linear neural network layers that are either equivariant or invariant to permutations of their inputs form core building blocks of modern deep learning architectures. Examples include the layers of DeepSets, as well as linear layers occurring in attention blocks of transformers and some graph neural networks.
  arXiv  Detail & Related papers  (2023-03-10T21:13:12Z)
• Equivariant Disentangled Transformation for Domain Generalization under Combination Shift [91.38796390449504]
  Combinations of domains and labels are not observed during training but appear in the test environment. We provide a unique formulation of the combination shift problem based on the concepts of homomorphism, equivariance, and a refined definition of disentanglement.
  arXiv  Detail & Related papers  (2022-08-03T12:31:31Z)
• Commutative Lie Group VAE for Disentanglement Learning [96.32813624341833]
  We view disentanglement learning as discovering an underlying structure that equivariantly reflects the factorized variations shown in data. A simple model named Commutative Lie Group VAE is introduced to realize the group-based disentanglement learning. Experiments show that our model can effectively learn disentangled representations without supervision, and can achieve state-of-the-art performance without extra constraints.
  arXiv  Detail & Related papers  (2021-06-07T07:03:14Z)
• LieTransformer: Equivariant self-attention for Lie Groups [49.9625160479096]
  Group equivariant neural networks are used as building blocks of group invariant neural networks. We extend the scope of the literature to self-attention, that is emerging as a prominent building block of deep learning models. We propose the LieTransformer, an architecture composed of LieSelfAttention layers that are equivariant to arbitrary Lie groups and their discrete subgroups.
  arXiv  Detail & Related papers  (2020-12-20T11:02:49Z)
• Invariant Feature Coding using Tensor Product Representation [75.62232699377877]
  We prove that the group-invariant feature vector contains sufficient discriminative information when learning a linear classifier. A novel feature model that explicitly consider group action is proposed for principal component analysis and k-means clustering.
  arXiv  Detail & Related papers  (2019-06-05T07:15:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.