Learning to Trace Seiberg Dualities

• URL: http://arxiv.org/abs/2607.28628v1
• Date: Thu, 30 Jul 2026 17:59:56 GMT
• Title: Learning to Trace Seiberg Dualities
• Abstract summary: We use machine learning methods to address the question for Seiberg dualities of supersymmetric quiver gauge theories.<n>On the one hand, this leads us to a practical tool for establishing the computational complexity of different dualities.<n>We find that for quivers with a modest number of quiver nodes, different network architectures tend to outperform deterministic algorithms.
• Score: 39.146761527401424
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dualities play an important role in establishing both microscopic and emergent phenomena in a wide range of physical systems. In practice, though, it can often be computationally challenging to establish when two systems are dual, even when all of the "rules of the game" are well-known. Said differently, when confronted with two systems, how can one efficiently establish that they are in fact dual? In this paper we use machine learning methods to address this question for Seiberg dualities of supersymmetric quiver gauge theories. Mathematically, this involves establishing mutations of quivers, which is in turn a variation on the theme of "learning to unknot". On the one hand, this leads us to a practical tool for establishing the computational complexity of different dualities. On the other hand, it also allows us to study how different network architectures learn how to trace Seiberg dualities. We find that for quivers with a modest number of quiver nodes (of order $10$), different network architectures consisting of transformers and multi-layer perceptrons tend to outperform deterministic algorithms. Supplementing the network by well-established pathfinder algorithms (essentially "Google Maps for quivers") leads to an additional improvement in the efficiency and accuracy of the search strategy. We anticipate that this class of questions can serve as a useful benchmark for frontier AI models applied to theoretical physics.

Related papers

• 2D Quon Language: Unifying Framework for Cliffords, Matchgates, and Beyond [4.886638121226719]
  We make progress toward the unified understanding of the Clifford and matchgate.<n>We introduce the 2D Quon language, which combines Majorana worldlines with their underlying spacetime topology.<n>We discuss a range of applications of our approach, from recovering well-known results such as the Kramers-Wannier duality.
  arXiv  Detail & Related papers  (2025-05-09T18:00:00Z)
• Learning to Solve Geometry Problems via Simulating Human Dual-Reasoning Process [84.49427910920008]
  Geometry Problem Solving (GPS) has attracted much attention in recent years. It requires a solver to comprehensively understand both text and diagram, master essential geometry knowledge, and appropriately apply it in reasoning. Existing works follow a paradigm of neural machine translation and only focus on enhancing the capability of encoders, which neglects the essential characteristics of human geometry reasoning.
  arXiv  Detail & Related papers  (2024-05-10T03:53:49Z)
• An example of use of Variational Methods in Quantum Machine Learning [0.0]
  This paper introduces a quantum neural network for the binary classification of points of a specific geometric pattern on a plane. The intention was to produce a quantum deep neural network with the minimum number of trainable parameters capable of correctly recognising and classifying points.
  arXiv  Detail & Related papers  (2022-08-07T03:52:42Z)
• Unified Field Theory for Deep and Recurrent Neural Networks [56.735884560668985]
  We present a unified and systematic derivation of the mean-field theory for both recurrent and deep networks. We find that convergence towards the mean-field theory is typically slower for recurrent networks than for deep networks. Our method exposes that Gaussian processes are but the lowest order of a systematic expansion in $1/n$.
  arXiv  Detail & Related papers  (2021-12-10T15:06:11Z)
• Decoupled and Memory-Reinforced Networks: Towards Effective Feature Learning for One-Step Person Search [65.51181219410763]
  One-step methods have been developed to handle pedestrian detection and identification sub-tasks using a single network. There are two major challenges in the current one-step approaches. We propose a decoupled and memory-reinforced network (DMRNet) to overcome these problems.
  arXiv  Detail & Related papers  (2021-02-22T06:19:45Z)
• Gradient-based Competitive Learning: Theory [1.6752712949948443]
  This paper introduces a novel perspective in this area by combining gradient-based and competitive learning. The theory is based on the intuition that neural networks are able to learn topological structures by working directly on the transpose of the input matrix. The proposed approach has a great potential as it can be generalized to a vast selection of topological learning tasks.
  arXiv  Detail & Related papers  (2020-09-06T19:00:51Z)
• Suppress and Balance: A Simple Gated Network for Salient Object Detection [89.88222217065858]
  We propose a simple gated network (GateNet) to solve both issues at once. With the help of multilevel gate units, the valuable context information from the encoder can be optimally transmitted to the decoder. In addition, we adopt the atrous spatial pyramid pooling based on the proposed "Fold" operation (Fold-ASPP) to accurately localize salient objects of various scales.
  arXiv  Detail & Related papers  (2020-07-16T02:00:53Z)
• Dual Learning: Theoretical Study and an Algorithmic Extension [168.0485041314289]
  We propose multi-step dual learning, in which we leverage feedback signals from additional domains to improve the qualities of mappings. We prove that multi-step dual learn-ing can boost the performance of standard dual learning under mild conditions.
  arXiv  Detail & Related papers  (2020-05-17T12:14:35Z)
• SpatialSim: Recognizing Spatial Configurations of Objects with Graph Neural Networks [31.695447265278126]
  We show how a machine can learn and compare classes of geometric spatial configurations that are invariant to the point of view of an external observer. We propose SpatialSim (Spatial Similarity), a novel geometrical reasoning benchmark, and argue that progress on this benchmark would pave the way towards a general solution. Secondly, we study how inductive relational biases exhibited by fully-connected message-passing Graph Neural Networks (MPGNNs) are useful to solve those tasks.
  arXiv  Detail & Related papers  (2020-04-09T14:13:20Z)
• Connecting Dualities and Machine Learning [0.0]
  Dualities are widely used in quantum field theories and string theory to obtain correlation functions at high accuracy. Here we present examples where dual data representations are useful in supervised classification, linking machine learning and typical tasks in theoretical physics. We find that additional contributions to the loss based on feature separation, feature matching with respect to desired representations, and a good performance on a simple' correlation function can lead to known and unknown dual representations.
  arXiv  Detail & Related papers  (2020-02-12T19:00:02Z)

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.