AIarXiv

Ranked by formulaVerdict: Notable

Macrocanonical Generator Networks: Data-Efficient Neural Surrogates for Amortized Physics Simulation

Many scientific simulations are computationally expensive, limiting their use in simulation-based inference, uncertainty quantification, and decision making.

By Jeffrey, Wandelt

Score██████░░░░5.6

VerdictWorth a reader's time today.

Read the originalPDF

Abstract

Many scientific simulations are computationally expensive, limiting their use in simulation-based inference, uncertainty quantification, and decision making. We introduce macrocanonical generator networks, a framework for learning fast, data-efficient neural surrogates for amortized simulation of stationary physical processes by matching multiscale statistics of a target process. Inspired by microcanonical maximum-entropy synthesis, which matches feature statistics per sample by inner-loop optimization, our approach instead trains a neural generator to satisfy the same constraints in expectation, preserving physically realistic sample-to-sample fluctuations. We prove that gradient-descent training induces preconditioned gradient-descent dynamics in sample space that inherit the symmetry-preservation properties of the microcanonical gradient descent of Bruna and Mallat, amortizing its per-sample inner-loop optimization into a single training run after which every sample is generated in one forward pass. We further show that residual generator parameterizations initialized near the identity, trained with a small learning rate, preserve entropy locally during early optimization and mitigate mode collapse. Experiments on cosmology and fluid simulations show that macrocanonical generators recover realistic samples from extremely small training sets, in some cases a single training example, while generating new realizations more than 10⁶ times faster per sample than the reference simulator and more than 10³ times faster than microcanonical gradient descent. The trained generators can be reused for downstream pretraining, including simulation-based inference, providing a data-efficient route to multi-fidelity scientific machine learning workflows.

Niall Jeffrey, Benjamin D. Wandelt

The editor's rubric

Heuristic review

Leverage3 / 5
A method or resource many groups across the field will adopt within a year.
18% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
20% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
22% of this desk’s rubric
Novelty3 / 5
A genuinely new approach to an open problem.
22% of this desk’s rubric
Trajectory2 / 5
Some room to improve with obvious engineering.
10% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
8% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); gains (x-fold); verification (error bars); scale (efficient).

How the score was computed

rank-2026-10-18

Score██████░░░░5.6

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
5.6 / 10
Weighted rubric, evidence-gated.
Adjusted merit
5.6 / 10
Shrunk toward the desk prior by editor confidence (38%).
Attention
0%
Citations, upvotes, points, mentions.
Freshness
0%
Half-life decay since publication.

No attention signals recorded yet.

The record

  • Reviewed by heuristic-v10 on Nov 4, 2026, 07:23 UTC. Paper type: theory.
  • Categories: cs.LG, astro-ph.CO, stat.ML
  • TOP, No.6 in the Front page edition of November 4, 2026.
  • TOP, No.1 in the Physics edition of November 4, 2026.