REVIEW 4 cited by
Simplifying Polylogarithms 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
read the original abstract
Polylogrithmic functions, such as the logarithm or dilogarithm, satisfy a number of algebraic identities. For the logarithm, all the identities follow from the product rule. For the dilogarithm and higher-weight classical polylogarithms, the identities can involve five functions or more. In many calculations relevant to particle physics, complicated combinations of polylogarithms often arise from Feynman integrals. Although the initial expressions resulting from the integration usually simplify, it is often difficult to know which identities to apply and in what order. To address this bottleneck, we explore to what extent machine learning methods can help. We consider both a reinforcement learning approach, where the identities are analogous to moves in a game, and a transformer network approach, where the problem is viewed analogously to a language-translation task. While both methods are effective, the transformer network appears more powerful and holds promise for practical use in symbolic manipulation tasks in mathematical physics.
Forward citations
Cited by 4 Pith papers
-
Scattering Amplitudes as Programs: Self-Evolving Search for Theory and Event Generation
Self-evolving program search over scattering amplitudes discovers known and hybrid evaluation structures, cutting counted arithmetic ~48x and reaching within ~14x of optimized MadGraph at n=6 while beating the tested ...
-
Graph Neural Networks for the Graphical Bootstrap
GNNs and graph transformers classify vanishing coefficients on millions of N=4 SYM f-graphs, generalizing to larger n with 99.996% ROC AUC and pruning up to 85.5% of redundant d-graphs.
-
Analytic Regression of Feynman Integrals from High-Precision Numerical Sampling
Multi-point lattice reduction on high-precision numerical samples can recover exact analytic expressions for multi-loop Feynman integrals with rational coefficients.
-
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.