REVIEW 3 cited by
Reconstructing $S$-matrix Phases with Machine Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
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.
Forward citations
Cited by 3 Pith papers
-
Descending into the Modular Bootstrap
Numerical search finds candidate modular-invariant spectra with integer degeneracies for 1 < c < 8/7 and hints at a stronger gap bound near c = 1.
-
The S-matrix bootstrap with neural optimizers I: zero double discontinuity
A neural optimizer solves the Atkinson-Mandelstam unitarity equations over the full space of amplitudes and, together with standard bootstrap methods, maps the allowed region of zero-double-discontinuity S-matrices, t...
-
Explainable AI-assisted Optimization for Feynman Integral Reduction
FunSearch discovered a simple priority function for ordering IBP seeding integrals, reducing the number needed for multi-loop Feynman integral reductions by factors up to 3058.
Discussion (0). Continue with ORCID to comment.