arXiv Machine Learning

Generative Monte Carlo Sampling for Constant-Cost Particle Transport

Generative Monte Carlo (GMC) is a new particle transport simulation method that embeds generative AI into solving the linear Boltzmann equation. By treating cell transmission as a conditional generation task, neural networks trained with conditional flow matching produce particle exit states—position, direction, and path length—without simulating scattering histories. GMC generalizes across materials using optical coordinate scaling, matches standard Monte Carlo’s statistical accuracy and convergence, and achieves constant‑cost per cell transmission, offering significant speedups in optically thick regimes.

Hugging Face Trending Papers
Jul 29

Equilibrium Training of Energy-Based Models with Parallel Trajectory Tempering

Energy-Based Models (EBMs) provide an interpretable framework for generative modeling of scientific data, but poor Markov Chain Monte Carlo mixing often limits their reliability. We introduce a training algorithm based on Parallel Trajectory Tempering (PTT), which exploits the continuity of the optimization path to maintain equilibrium sampling throughout learning.

arXiv Statistics ML
Aug 25

Neural Boltzmann Equations

arXiv:2608.23022v1 Announce Type: cross Abstract: The dynamics of particles in the early universe are described by Boltzmann equations, which involve high-dimensional phase-space integrals. Classical...

By Jonas Spinner, Jack Shergold
arXiv Machine Learning
Sep 10

Mind the Gap: Navigating Inference with Optimal Transport Maps

The paper introduces a model calibration method using optimal transport to address discrepancies between simulation and experimental data in high-dimensional machine learning applications. Applied to jet tagging in particle physics, the technique calibrates a 128‑dimensional latent representation from a general‑purpose classifier, ensuring downstream derived quantities are properly calibrated. This enables more reliable use of foundation models for jet flavor analysis in LHC experiments and offers a general framework for correcting high‑dimensional simulations across scientific fields.

By Malte Algren, Tobias Golling, Francesco Armando Di Bello, Christopher Pollard
arXiv Machine Learning
Jun 4

CaloTrilogy: Toward a Breakthrough in One-Step, End-to-End, Physics-Guided Shower Generation for Modern Calorimeters

arXiv:2606. 04165v1 Announce Type: cross Abstract: High-precision calorimeter simulation at current and future colliders imposes rapidly growing computational demands, motivating the development of machine-learning surrogates for traditional Monte Carlo tools such as Geant4.

By Cheng Jiang, Sitian Qian, Kevin Pedro, Oz Amram, Huilin Qu, Maggie Voetberg
arXiv Machine Learning
2d ago

Training Energy-Based Models with Non-MCMC Samplers and Efficient Temperature Estimation

The paper introduces Langevin simulated bifurcation (LSB), a fast, parallel Boltzmann sampler that matches the accuracy of sequential MCMC methods. It also proposes conditional expectation matching (CEM), an efficient technique for estimating the effective temperature of samples from energy‑based models with conditional independence. Building on these, the authors develop sampler adaptive learning (SAL), which adjusts the model temperature to align with the distribution produced by LSB, enabling efficient training of semi‑restricted Boltzmann machines (SRBMs) and outperforming conventional methods on synthetic spin‑glass datasets.

By Kentaro Kubo, Hayato Goto