From Symmetry to Invariance: Learning Galois Equivalent Representations in Finite Fields

• URL: http://arxiv.org/abs/2608.22513v1
• Date: Sun, 23 Aug 2026 17:19:54 GMT
• Title: From Symmetry to Invariance: Learning Galois Equivalent Representations in Finite Fields
• Abstract summary: We study the question through multiplication in finite fields under changes of basis.<n>The Galois action organizes basis representations into orbits, and bases in the same orbit induce the same coordinate multiplication map.<n>We train a model to predict the Galois action between basis representations.<n>Repeated applications of the learned transformation are then used to construct a canonical representative for each orbit.
• Score: 8.640569733631528
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Neural networks can learn algebraic operations from finite examples, but it remains unclear whether this ability transfers across mathematically equivalent representations of the same operation. We study this question through multiplication in finite fields under changes of basis. The Galois action organizes basis representations into orbits, and bases in the same orbit induce the same coordinate multiplication map. This structure allows us to separate learning multiplication from transferring it to basis representations that are not used for training. We examine several ways of providing or recovering the relevant orbit structure, including invariant labels, basis matrices, orbit recognition, and algebraic decomposition. Our main approach trains a model to predict the Galois action between basis representations. Repeated applications of the learned transformation are then used to construct a canonical representative for each orbit, which supports multiplication on held-out bases through exact canonical matching. This provides a concrete mechanism for converting a learned algebraic symmetry into an invariant representation that can be used for transfer.

Related papers

• Representation Redundancy and Structural Complexity in Finite-Field Inversion [8.640569733631528]
  We study the phenomenon for inversion over (mathbb F_2n) with field elements expressed in varying ordered (mathbb F)-bases.<n>We prove that two ordered bases induce the same coordinate inversion map if and only if they belong to the same Galois orbit.
  arXiv  Detail & Related papers  (2026-09-04T00:33:03Z)
• Rethinking Diffusion Models with Symmetries through Canonicalization with Applications to Molecular Graph Generation [56.361076943802594]
  CanonFlow achieves state-of-the-art performance on the challenging GEOM-DRUG dataset, and the advantage remains large in few-step generation.
  arXiv  Detail & Related papers  (2026-02-16T18:58:55Z)
• Constructing Invariant and Equivariant Operations by Symmetric Tensor Network [8.759616567360537]
  This work presents a systematic method for constructing valid invariant and equivariant operations.<n>It can handle inputs and outputs in the form of Cartesian tensors with different rank, as well as spherical tensors with different types.<n>We also apply this approach to design the equivariant interaction message for the geometry graph neural network, and equivariant machine learning model to learn the law of materials.
  arXiv  Detail & Related papers  (2025-08-18T03:13:08Z)
• Why Neural Network Can Discover Symbolic Structures with Gradient-based Training: An Algebraic and Geometric Foundation for Neurosymbolic Reasoning [73.18052192964349]
  We develop a theoretical framework that explains how discrete symbolic structures can emerge naturally from continuous neural network training dynamics.<n>By lifting neural parameters to a measure space and modeling training as Wasserstein gradient flow, we show that under geometric constraints, the parameter measure $mu_t$ undergoes two concurrent phenomena.
  arXiv  Detail & Related papers  (2025-06-26T22:40:30Z)
• Symmetry Discovery for Different Data Types [52.2614860099811]
  Equivariant neural networks incorporate symmetries into their architecture, achieving higher generalization performance. We propose LieSD, a method for discovering symmetries via trained neural networks which approximate the input-output mappings of the tasks. We validate the performance of LieSD on tasks with symmetries such as the two-body problem, the moment of inertia matrix prediction, and top quark tagging.
  arXiv  Detail & Related papers  (2024-10-13T13:39:39Z)
• 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 Neurons: Adjoint-Equivariant Neural Networks for Semisimple Lie Algebras [5.596048634951087]
  This paper proposes an equivariant neural network that takes data in any semi-simple Lie algebra as input. The corresponding group acts on the Lie algebra as adjoint operations, making our proposed network adjoint-equivariant. Our framework generalizes the Vector Neurons, a simple $mathrmSO(3)$-equivariant network, from 3-D Euclidean space to Lie algebra spaces.
  arXiv  Detail & Related papers  (2023-10-06T18:34:27Z)
• Algebras of actions in an agent's representations of the world [46.74201905814679]
  We use our framework to reproduce the symmetry-based representations from the symmetry-based disentangled representation learning formalism.<n>We then study the algebras of the transformations of worlds with features that occur in simple reinforcement learning scenarios.<n>Using computational methods, that we developed, we extract the algebras of the transformations of these worlds and classify them according to their properties.
  arXiv  Detail & Related papers  (2023-10-02T18:24:51Z)
• 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)
• Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras from First Principles [55.41644538483948]
  We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the transformations symmetry and the corresponding generators. Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
  arXiv  Detail & Related papers  (2023-01-13T16:25:25Z)
• Connecting Permutation Equivariant Neural Networks and Partition Diagrams [0.0]
  We show that all of the weight matrices that appear in Permutation equivariant neural networks can be obtained from Schur-Weyl duality. In particular, we adapt Schur-Weyl duality to derive a simple, diagrammatic method for calculating the weight matrices themselves.
  arXiv  Detail & Related papers  (2022-12-16T18:48:54Z)
• 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)
• 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)
• Applying Lie Groups Approaches for Rigid Registration of Point Clouds [3.308743964406687]
  We use Lie groups and Lie algebras to find the rigid transformation that best register two surfaces represented by point clouds. The so called pairwise rigid registration can be formulated by comparing intrinsic second-order orientation tensors. We show promising results when embedding orientation tensor fields in Lie algebras.
  arXiv  Detail & Related papers  (2020-06-23T21:26:57Z)

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.