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.
Two decades of algorithmic feynman integral reduction
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
hep-ph 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
A new generating-function framework turns IBP relations into differential equations in a non-commutative algebra, yielding an iterative algorithm that derives symbolic reduction rules and checks completeness for topologies such as the sunset and double-box diagrams.
SIRENA automates IBP reduction of sum-integrals in finite-temperature QFT, reproduces known results to 3 loops, supplies new 3-loop fermionic reductions, and derives an analytic factorization formula for arbitrary 2-loop fermionic sum-integrals.
citing papers explorer
-
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.
-
An Algorithm for the Symbolic Reduction of Multi-loop Feynman Integrals via Generating Functions
A new generating-function framework turns IBP relations into differential equations in a non-commutative algebra, yielding an iterative algorithm that derives symbolic reduction rules and checks completeness for topologies such as the sunset and double-box diagrams.
-
SIRENA -- Sum-Integral REductioN Algorithm
SIRENA automates IBP reduction of sum-integrals in finite-temperature QFT, reproduces known results to 3 loops, supplies new 3-loop fermionic reductions, and derives an analytic factorization formula for arbitrary 2-loop fermionic sum-integrals.