Learning to Unscramble Feynman Loop Integrals with SAILIR

TL;DR

SAILIR introduces a self-supervised, transformer-based machine learning method for Feynman integral reduction that maintains bounded memory usage even for complex integrals, surpassing traditional algorithms in memory efficiency.

Contribution

The paper presents SAILIR, a novel self-supervised AI approach that guides IBP reduction with a transformer classifier, enabling high-complexity integral reduction with limited memory.

Findings

SAILIR reduces integrals with constant memory consumption across complexity levels.

Compared to Kira, SAILIR uses 40% less memory for complex integrals.

SAILIR achieves comparable reduction times despite being slower in wall-clock time.

Abstract

Integration-by-parts (IBP) reduction of Feynman integrals to master integrals is a key computational bottleneck in precision calculations in high-energy physics. Traditional approaches based on the Laporta algorithm require solving large systems of equations, leading to memory consumption that grows rapidly with integral complexity. We present SAILIR (Self-supervised AI for Loop Integral Reduction), a new machine learning approach in which a transformer-based classifier guides the reduction of integrals one step at a time in a fully online fashion. The classifier is trained in an entirely self-supervised manner on synthetic data generated by a scramble/unscramble procedure: known reduction identities are applied in reverse to build expressions of increasing complexity, and the classifier learns to undo these steps. When combined with beam search and a highly parallelized, asynchronous, single-episode reduction strategy, SAILIR can reduce integrals of arbitrarily high weight with bounded memory. We benchmark SAILIR on the two-loop triangle-box topology, comparing against the state-of-the-art IBP reduction code Kira across 16 integrals of varying complexity. While SAILIR is slower in wall-clock time, its per-worker memory consumption remains approximately flat regardless of integral complexity, in contrast to Kira whose memory grows rapidly with complexity. For the most complex integrals considered here, SAILIR uses only 40\% of the memory of Kira while achieving comparable reduction times. This demonstrates a fundamentally new paradigm for IBP reduction in which the memory bottleneck of Laporta-based approaches could be entirely overcome, potentially opening the door to precision calculations that are currently intractable.