Pith. sign in

REVIEW 1 cited by

(Machine) Learning amplitudes for faster event generation

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

arxiv 1912.11055 v2 pith:5UWRYCMO submitted 2019-12-23 hep-ph

(Machine) Learning amplitudes for faster event generation

classification hep-ph
keywords amplitudeseventevaluationexactfastergeneratorslearningmachine
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We propose to replace the exact amplitudes used in MC event generators for trained Machine Learning regressors, with the aim of speeding up the evaluation of {\it slow} amplitudes. As a proof of concept, we study the process $gg \to ZZ$ whose LO amplitude is loop induced. We show that gradient boosting machines like $\texttt{XGBoost}$ can predict the fully differential distributions with errors below $0.1 \%$, and with prediction times $\mathcal{O}(10^3)$ faster than the evaluation of the exact function. This is achieved with training times $\sim 7$ minutes and regressors of size $\lesssim 30$~Mb. These results suggest a possible new avenue to speed up MC event generators.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Amplitude Uncertainties Everywhere All at Once

    hep-ph 2025-08 unverdicted novelty 4.0

    Compares ensemble, Bayesian, and evidential regression approaches for uncertainty quantification in amplitude surrogates and shows they detect localized training data issues.