mlsanityData to 7 Oct 2026

Reconstructing S-matrix Phases with Machine Learning

arXiv 2308.09451 ↗First posted 18 Aug 2023hep-th cs.LG hep-phcited by 4

Not on the map. Why?

Abstract (arXiv)

An important element of the S-matrix bootstrap program is the relationship between the modulus of an S-matrix element and its phase. Unitarity relates them by an integral equation. Even in the simplest case of elastic scattering, this integral equation cannot be solved analytically and numerical approaches are required. We apply modern machine learning techniques to studying the unitarity constraint. We find that for a given modulus, when a phase exists it can generally be reconstructed to good accuracy with machine learning. Moreover, the loss of the reconstruction algorithm provides a good proxy for whether a given modulus can be consistent with unitarity at all. In addition, we study the question of whether multiple phases can be consistent with a single modulus, finding novel phase-ambiguous solutions. In particular, we find a new phase-ambiguous solution which pushes the known limit on such solutions significantly beyond the previous bound.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 7 of its 56 references that are in the map. First posted on arXiv 18 Aug 2023.

Builds on

7 of 56 references.

References · 7

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2019DeepXDE: A deep learning library for solving differential equationscited by 617
  4. 2019AI Feynman: a Physics-Inspired Method for Symbolic Regressioncited by 536
  5. 2017CaloGAN: Simulating 3D High Energy Particle Showers in Multi-Layer Electromagnetic Calorimeters with Generative Adversarial Networkscited by 78
  6. 2023Deep Generative Symbolic Regression with Monte-Carlo-Tree-Searchcited by 40
  7. 2020nPINNs: nonlocal Physics-Informed Neural Networks for a parametrized nonlocal universal Laplacian operator. Algorithms and Applicationscited by 36

Built on by

Cited by year

Citing papers per year: 2024: 2; 2025: 2.

4 papers.