Event Generation with Parallel Langevin Sampling and Learned Stein Diagnostics

· Source: stat.ML updates on arXiv.org · Field: Science & Research — Physical Sciences & Chemistry, Mathematics & Computational Sciences, Artificial Intelligence & Machine Learning · Depth: Expert, long

Summary

A novel event generation method addresses the computational bottleneck in precision collider phenomenology, particularly for high-multiplicity final states at facilities like the high-luminosity Large Hadron Collider. This approach utilizes many parallel underdamped Langevin chains, extracting a single terminal state from each to produce unweighted events while circumventing within-chain autocorrelation. A learned Stein discrepancy (LSD) serves as a data-driven convergence diagnostic, estimating the relaxation time. Applied to tree-level u\bar{u}\to Z+ng event generation, the method demonstrates that relaxation needs only a modest number of exact-target Langevin steps, with growth mildly increasing with multiplicity. Furthermore, neural-network surrogate initialization significantly reduces the required exact matrix-element and gradient evaluations. The technique was validated using an Ornstein–Uhlenbeck process in d=4 and d=16 dimensions, showing LSD accurately tracks analytic convergence and the importance of a boundary function for sharp phase-space cuts.

Key takeaway

For Research Scientists and Machine Learning Engineers facing computational bottlenecks in high-multiplicity event generation, you should consider adopting parallel Underdamped Langevin Algorithm (ULA) sampling. This method, combined with learned Stein discrepancy diagnostics, offers a path to efficiently generate unweighted events without the limitations of rejection sampling. Integrating neural network surrogates for initial chain equilibration can further reduce expensive matrix-element and gradient evaluations, significantly accelerating your simulation workflows.

Key insights

Parallel Langevin sampling with learned Stein diagnostics efficiently generates unweighted collider events, overcoming rejection sampling limitations.

Principles

Method

Evolve parallel Underdamped Langevin Algorithm (ULA) chains with Metropolis-Hastings corrections and momentum updates. Use a learned Stein discrepancy to determine relaxation time and neural network surrogates for initial acceleration.

In practice

Topics

Code references

Best for: AI Scientist, Machine Learning Engineer, Research Scientist

Related on AIssential

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by stat.ML updates on arXiv.org.