REVIEW 10 cited by
Explainable AI-assisted Optimization for Feynman Integral Reduction
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
Explainable AI-assisted Optimization for Feynman Integral Reduction
read the original abstract
We present a novel approach to optimizing the reduction of Feynman integrals using integration-by-parts identities. By developing a priority function through the FunSearch algorithm, which combines large language models and genetic algorithms, we achieve significant improvements in memory usage and computational efficiency compared to traditional methods. Our approach demonstrates substantial reductions in the required seeding integrals, making previously intractable integrals more manageable. Tested on a variety of Feynman integrals, including one-loop and multi-loop cases with planar and non-planar configurations, our method demonstrates remarkable scalability and adaptability. For reductions of certain Feynman integrals with many dots and numerators, we observed an improvement by a factor of 3058 compared to traditional methods. This work provides a powerful and interpretable framework for optimizing IBP reductions, paving the way for more efficient and practical calculations in high-energy physics.
Forward citations
Cited by 10 Pith papers
-
Efficient AI-Inspired Reduction of Feynman Integrals via Tube Seeding
Machine learning discovers a tube-seeding strategy for IBP reduction of Feynman integrals that scales linearly with numerator power, demonstrated on rank-20 2-loop 5-point integrals.
-
The four-loop non-singlet splitting functions in QCD
Four-loop non-singlet splitting functions in QCD are computed analytically for the first time, with numerical representations provided.
-
Learning to Unscramble Feynman Loop Integrals with SAILIR
A self-supervised transformer learns to unscramble Feynman integrals for online IBP reduction, delivering bounded memory use on complex two-loop topologies while matching Kira's speed on the hardest cases tested.
-
The spectrum of Feynman-integral geometries at two loops
Two-loop Feynman integrals involve Riemann spheres, elliptic curves, hyperelliptic curves of genus 2 and 3, K3 surfaces, and a rationalizable Del Pezzo surface of degree 2.
-
Feynman integral reduction by covariant differentiation
Covariant differentiation on the dual vector space spanned by master integrals reduces a large class of Feynman integrals to masters, with connections reusable across mass configurations.
-
Feynman integral reduction with intersection theory made simple
Branch representation reduces the variable count for intersection-theory-based Feynman integral reduction to at most 3L-3 for L-loop integrals regardless of leg number.
-
Learning to Unscramble: Simplifying Symbolic Expressions via Self-Supervised Oracle Trajectories
A permutation-equivariant transformer trained on self-supervised oracle trajectories from scrambled expressions achieves near-perfect simplification rates for dilogarithms and 100% success on 5-point gluon scattering ...
-
On the spanning cuts consistency problem in the IBP reductions of Feynman integrals
Inconsistency in spanning cuts for IBP reductions arises because cuts can make hidden terms in IBP relations finite via pinch singularities that cancel vanishing parameters, linked to hidden linear relations between p...
-
AI-Driven Discovery of Information-Efficient Collider Observables for Interference Measurements
AI-driven symbolic evolution discovers interpretable event-level observables that retain substantially more local Fisher information than angular baselines for CP-sensitive HZ interference in two collider channels.
-
AMFlow 2.0: significant algorithmic and software improvements for Feynman integral evaluation
AMFlow 2.0 cuts symbolic and numerical cost of multi-loop Feynman integral evaluation via an FT recursion mode, a C++ DE solver, and modern IBP reducers, demonstrated on a three-loop five-point family.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.