Identifying the Group-Theoretic Structure of Machine-Learned Symmetries

• URL: http://arxiv.org/abs/2309.07860v1
• Date: Thu, 14 Sep 2023 17:03:50 GMT
• Title: Identifying the Group-Theoretic Structure of Machine-Learned Symmetries
• Authors: Roy T. Forestano, Konstantin T. Matchev, Katia Matcheva, Alexander Roman, Eyup B. Unlu, Sarunas Verner
• Abstract summary: We propose methods for examining and identifying the group-theoretic structure of such machine-learned symmetries. As an application to particle physics, we demonstrate the identification of the residual symmetries after the spontaneous breaking of non-Abelian gauge symmetries.
• Score: 41.56233403862961
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Deep learning was recently successfully used in deriving symmetry transformations that preserve important physics quantities. Being completely agnostic, these techniques postpone the identification of the discovered symmetries to a later stage. In this letter we propose methods for examining and identifying the group-theoretic structure of such machine-learned symmetries. We design loss functions which probe the subalgebra structure either during the deep learning stage of symmetry discovery or in a subsequent post-processing stage. We illustrate the new methods with examples from the U(n) Lie group family, obtaining the respective subalgebra decompositions. As an application to particle physics, we demonstrate the identification of the residual symmetries after the spontaneous breaking of non-Abelian gauge symmetries like SU(3) and SU(5) which are commonly used in model building.

Related papers

• Finding discrete symmetry groups via Machine Learning [0.0]
  We introduce a machine-learning approach capable of automatically discovering discrete symmetry groups in physical systems. This method identifies the finite set of parameter transformations that preserve the system's physical properties.
  arXiv  Detail & Related papers  (2023-07-25T12:37:46Z)
• Geometric Neural Diffusion Processes [55.891428654434634]
  We extend the framework of diffusion models to incorporate a series of geometric priors in infinite-dimension modelling. We show that with these conditions, the generative functional model admits the same symmetry.
  arXiv  Detail & Related papers  (2023-07-11T16:51:38Z)
• Towards Symmetry-Aware Generation of Periodic Materials [64.21777911715267]
  We propose SyMat, a novel material generation approach that can capture physical symmetries of periodic material structures. SyMat generates atom types and lattices of materials through generating atom type sets, lattice lengths and lattice angles with a variational auto-encoder model. We show that SyMat is theoretically invariant to all symmetry transformations on materials and demonstrate that SyMat achieves promising performance on random generation and property optimization tasks.
  arXiv  Detail & Related papers  (2023-07-06T01:05:34Z)
• Oracle-Preserving Latent Flows [58.720142291102135]
  We develop a methodology for the simultaneous discovery of multiple nontrivial continuous symmetries across an entire labelled dataset. The symmetry transformations and the corresponding generators are modeled with fully connected neural networks trained with a specially constructed loss function. The two new elements in this work are the use of a reduced-dimensionality latent space and the generalization to transformations invariant with respect to high-dimensional oracles.
  arXiv  Detail & Related papers  (2023-02-02T00:13:32Z)
• 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)
• One-dimensional symmetric phases protected by frieze symmetries [0.0]
  We make a systematic study of symmetry-protected topological gapped phases of quantum spin chains in the presence of the frieze space groups in one dimension using matrix product states. We identify seventeen distinct non-trivial phases, define canonical forms, and compare the topological indices obtained from the MPS analysis with the group cohomological predictions.
  arXiv  Detail & Related papers  (2022-02-25T18:41:26Z)
• Machine-learning hidden symmetries [0.0]
  We present an automated method for finding hidden symmetries, defined as symmetries that become manifest only in a new coordinate system that must be discovered. Its core idea is to quantify asymmetry as violation of certain partial differential equations, and to numerically minimize such violation over the space of all invertible transformations, parametrized as invertible neural networks.
  arXiv  Detail & Related papers  (2021-09-20T17:55:02Z)
• String order parameters for symmetry fractionalization in an enriched toric code [0.0]
  We study a simple model of symmetry-enriched topological order obtained by decorating a toric code model with lower-dimensional symmetry-protected topological states. We show that the symmetry fractionalization in this model can be characterized by string order parameters, and that these signatures are robust under the effects of external fields and interactions.
  arXiv  Detail & Related papers  (2020-11-05T17:15:53Z)
• Inverse Learning of Symmetries [71.62109774068064]
  We learn the symmetry transformation with a model consisting of two latent subspaces. Our approach is based on the deep information bottleneck in combination with a continuous mutual information regulariser. Our model outperforms state-of-the-art methods on artificial and molecular datasets.
  arXiv  Detail & Related papers  (2020-02-07T13:48:52Z)

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.