- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents GLOBE, a surrogate model for high-resolution 3D beam–field PIC simulations. It supports 10^7 PIC cells, achieves lower relative-L2 error, and captures finer spatial structure by reducing the error in low-frequency and medium-frequency domains.
Critical strengths
- GLOBE predicts full 3D beam–field evolution on grids containing 10 million cells, achieving over 100× faster inference than PIC simulation.
- The framework enforces physical constraints with little loss of prediction accuracy.
- Low-frequency and medium-frequency errors are significantly suppressed.
Critical weaknesses
- The 2nd contribution bullet point in introduction does not point to a research gap. In the 2nd paragraph of introduction, if I understand correctly, scalability of these hybrid designs is the sole declared research gap.
- It is unclear if the comparison with baselines is fair.
- Although GLOBE runs on large 3D grids, the scalability advantage remains unclear.
Questions for authors
- The 6600s and 4130s in Section 5 Experiments, do they refer to GPU seconds? I presume they do not mean the number of GPUs.
- Are the baselines adequately trained, and exposed to the same information as GLOBE and variances?
- Could you test the model with data outside training scope, to evaluate the model's transferability?
- Could you systematically increase resolution and measure how runtime and memory grow compared to baselines?
6 comments
Response to Reviewer ZQWH (2/2)
Q3. Testing outside the training scope.
We generated new out-of-distribution (OOD) test sets of 19 bunched-beam transport and 20 PWFA trajectories. For each simulation, we sample multiple design parameters outside their training ranges, for example sampling phase advance between 50–60° or 85–89° (training 60–85°) for bunched-beam transport and driver charge 1.2–1.6 (training up to 1.2) for PWFA. None of these configurations is seen during training, and all models are evaluated with the same protocol as the main test sets (reported in Rel- error):
| Model | Bunched-beam transport (19) | PWFA (20) |
|---|---|---|
| GLOBE-D | 0.193 | 0.311 |
| GLOBE-C, mean of 8 samples | 0.194 | 0.312 |
| GLOBE-C, single sample | 0.207 | 0.319 |
| DPOT | 0.308 | 0.319 |
| MPP | 0.436 | 0.526 |
| UPT | 0.865 | 0.747 |
| P3D-D | 0.904 | 0.739 |
| P3D-G | 0.655 | 1.829 |
| HFS (in our latent space) | 0.359 | 1.569 |
| HFS+DM (in our latent space) | 0.371 | 2.536 |
On bunched-beam transport, GLOBE-D's error is 37% lower than that of the best baseline (DPOT, 0.308). On PWFA, GLOBE-D (0.311) and DPOT (0.319) are comparable, and both are far more accurate than the other baselines. Every model's error is higher than the error on in-distribution test sets (Table 1), as expected under a distribution shift. These results assess robustness to unseen configurations outside the training ranges. We do not claim transfer to other machines, lattices, or geometries, which remains future work.
W3 / Q4. Computational scalability and resolution dependence.
We clarify that GLOBE's advantage is computationally tractable prediction on high-resolution 3D grids that preserves fine-scale structure, not resolution invariance property. Unlike discretization-invariant neural operators such as FNO (Li et al., 2021), GLOBE is trained at a fixed spatial resolution, and we do not claim zero-shot transfer to other discretizations.
- Computational advantage. GLOBE compresses 28.9M / 15.7M grid cells into 28.2K / 30.6K latent tokens, which makes global attention and generative refinement feasible at this resolution. GLOBE-C is 102× / 189× faster than WarpX and 23× / 14× faster than P3D-G, which generates the full state, and the hybrid HFS baselines did not scale to our full grids (Section 5.3). GLOBE is not the fastest surrogate, since DPOT has has faster inference runtime, but DPOT is less accurate (Rel- 0.177 / 0.224 vs. 0.144 / 0.174 for GLOBE-D) and recovers much less fine-scale structure (mid-band spectral error 0.986 / 0.377 vs. 0.457 / 0.300 for GLOBE-C).
- Cost structure. The convolutional encoder and decoder scale linearly with the number of grid cells, and the dynamics models see only the latent tokens. Full attention remains quadratic in the number of latent tokens, so its cost is set by the latent grid rather than the mesh, and compression reduces the token count by 1024× / 512×.
- Resolution-scaling study (in progress). Increasing the resolution further is beyond our resources: the current benchmarks took about 1,500 GPU hours to simulate and occupy about 7 TB, and doubling the resolution per axis would multiply both by at least 8. We are therefore conducting a controlled resolution-scaling study on progressively downsampled bunched-beam transport trajectories, retraining GLOBE-D, GLOBE-C, and baselines at each resolution and measuring inference time, training cost, peak GPU memory, and prediction error. This experiment characterizes computational scaling rather than zero-shot resolution transfer. We will report the results in a separate comment during the discussion period once it is completed.
- Limitation. The study uses coarsened versions of our PIC data, so it does not establish accuracy at resolutions finer than our benchmarks. GLOBE's learned latent representation is also resolution-dependent, and extending one trained model to arbitrary discretizations remains future work.
Revision. We will clarify the distinction between computational scalability and resolution invariance, add the resolution study and the OOD results to the appendix, and state these limitations.
We hope these clarifications address the reviewer's concerns.
References
- Z. Li et al. Fourier neural operator for parametric partial differential equations. ICLR (2021).
Dear Reviewer ZQWH,
The authors have submitted their rebuttal and we are closing in on the end of the discussion period. Please take some time to carefully read over the rebuttal and respond whether your concerns have been addressed.
Best, AC
Response to Reviewer ZQWH (1/2)
We thank the reviewer for the detailed and constructive feedback. We address W1, Q1, and W2 / Q2 here, and Q3 and W3 / Q4 in the next comment.
W1. The second contribution does not point to a research gap.
We acknowledge that the current introduction emphasizes the computational challenge of scaling hybrid deterministic–generative models but does not sufficiently motivate the separate challenge addressed by our physics-constrained operators. A learned surrogate predicts the charge density and fields at each time step without any mechanism that keeps them consistent with each other. They should satisfy the instantaneous constraints in Eqs. (2)–(3): Gauss's law ∇⋅E=ρ/ε0 and ∇⋅B=0, and, in the electrostatic regime, the Poisson equation linking E to ρ. Decoding from a compressed latent space and adding a sampled residual make violations more likely. Table 3 quantifies this. Without the constraint operator, the decoded PWFA fields violate Gauss's law and ∇⋅B=0 at the 10−2 to 10−3 level. Penalty terms in the loss can reduce such violations but cannot guarantee that they vanish. Our second contribution closes this gap with parameter-free operators built from the simulation's own discretization, which reduce both violations to the 10−7 level with nearly unchanged accuracy (Rel-L2 0.191 without, 0.194 with). We will revise the introduction to state three gaps: (1) long-horizon, mesh-resolved prediction of 3D beam–field evolution is largely unexplored, (2) existing hybrid deterministic–generative designs scale poorly to such grids and to heterogeneous field amplitudes, and (3) learned surrogates give no guarantee that predicted fields satisfy the field constraints.
Q1. Do 6600 s and 4130 s refer to GPU seconds?
Yes. Each is the wall-clock time of one WarpX simulation on one GPU, i.e., GPU seconds per trajectory (about 1.8 h and 1.1 h), not a number of GPUs. This matches the total compute reported for generating the two datasets in Appendix A (about 900 and 600 GPU hours for 474 and 504 runs). All surrogate inference times are also measured on one GPU, one trajectory at a time.
W2 / Q2. Are the baselines adequately trained and given the same information?
DPOT, MPP, and UPT change by about 1% or less over the last 10% of training (2.2% for DPOT on PWFA), so their training has converged. P3D's official recipe uses a constant learning rate, so its training is oscillatory. On PWFA, its error rises at 91% of training (0.123 to 0.128), drops sharply at 97% (0.105), and rises again at the final checkpoint (0.110), which produces the −11.1%. Bunched-beam transport shows a similar late step: the error stays at about 0.106 from 67% to 85% of training and then drops to 0.099 at 97% (−7.4%).
Revision. We will state the three research gaps in the introduction and add the training setup and convergence curves to the appendix.