- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Neuronal World Dynamics (NWD), an adaptive framework for particle simulation that maintains recurrent memory across particle-group split–merge operations. The method combines adaptive grouping, memory inheritance, and physics-aware constraints to improve long-term prediction. Theoretical analyses examine coarse-state ambiguity and reorganization-induced errors. Experiments on four benchmarks demonstrate improved long-horizon accuracy over existing baselines, with ablation studies supporting the importance of persistent memory.
Critical strengths
-
The paper introduces an interesting approach that preserves predictive context across particle-group split–merge operations by separating physical state updates from recurrent memory inheritance.
-
NWD achieves consistent improvements over existing baselines, particularly on N-body simulations. The ablation studies further demonstrate the importance of persistent memory, while physical diagnostics and computational analyses strengthen the evaluation.
Critical weaknesses
- The experiments do not clearly isolate the benefit of memory inheritance across split–merge events. Removing the handoff mechanism causes only a 2.8% performance degradation, raising questions about whether the improvements primarily come from persistent memory and adaptive grouping.
2.The split–merge scheduler relies on predefined rules rather than explicitly learned event decisions. Moreover, the public benchmark experiments use only one training seed and a fixed training budget, limiting evidence of robustness and generalization.
The paper presents an interesting and well-motivated framework for adaptive particle simulation, with convincing long-horizon improvements on the N-body benchmarks. However, the experimental evidence does not yet sufficiently isolate the effectiveness of the proposed memory inheritance mechanism, which constitutes the central novelty of the work. The limited multi-seed validation on public benchmarks also weakens the generality of the empirical conclusions.
Questions for authors
-
Can the authors provide stronger evidence that memory inheritance specifically improves predictions at split–merge events? For example, an event-centered analysis comparing prediction discontinuities and subsequent rollout errors with and without memory inheritance would be informative. This could help distinguish the contribution of the proposed handoff mechanism from the more general advantage of maintaining recurrent memory.
-
How sensitive is NWD to the lifecycle scheduler and event-attenuation settings? In particular, how does performance change with different split–merge frequencies, cardinality targets, and event attenuation coefficients? Given that the standalone N-body configuration sets the event-step learned-update coefficient to zero, it would be useful to clarify how much of the improvement is attributable to memory inheritance versus event suppression and adaptive allocation.
-
Do the improvements on Dam2D and Sand2D remain consistent across multiple independent training seeds and longer training schedules? The existing comparisons use a common number of optimization updates but do not match computational runtime or establish convergence. Additional evidence would help determine whether the hybrid's advantages reflect a robust architectural improvement.
6 comments
Rebuttal response (2/2)
Weakness #2 / Question #3. Seed replication and longer matched training
The mean gains persist beyond the original single-seed, 2,000-update comparison under both update-matched and runtime-matched training. Both architectures receive symmetric validation-based schedule selection and three fitted seeds, evaluated on all 25 Dam2D and 30 Sand2D test trajectories. Parentheses report seed SD; reductions are computed from the displayed mean MSEs.
| Dataset / budget | Enlarged GNS MSE | GNS+NWD MSE | Reduction |
|---|---|---|---|
| Dam2D / equal time, 8,366 s | 0.3409 (0.0384) | 0.2513 (0.0508) | 26.3% |
| Sand2D / equal time, 8,167 s | 0.0386 (0.0023) | 0.0344 (0.0018) | 10.9% |
| Dam2D / extended time, 12,548 s | 0.3341 (0.0258) | 0.1955 (0.0236) | 41.5% |
| Sand2D / extended time, 12,251 s | 0.0378 (0.0045) | 0.0340 (0.0027) | 10.1% |
The fixed-update gain is favorable in all three Sand2D seeds and two of three Dam2D seeds; the Dam2D equal-time gain is also favorable in two of three. The extended comparison increases the equal-time budget by 50% and uses three fresh seeds per architecture. The mean advantage remains 41.5% on Dam2D and 10.1% on Sand2D. Together, the update-matched, runtime-matched, and extended-runtime comparisons show that the mean advantage persists across seed replication and substantially longer training.
Thank you again for the constructive questions that helped strengthen our work and manuscript.
Thank you for your detailed responses and additional experiments. I appreciate the authors' efforts, which have addressed many of my initial concerns. I have two remaining questions: Does the benefit of memory inheritance remain consistent across different split–merge frequencies? Could the authors further clarify the relatively large variability across training seeds, particularly on Dam2D?
Rebuttal response (1/2)
Thank you for your careful assessment and for identifying the controls needed to distinguish inheritance, event attenuation, and public-benchmark robustness. Your comments helped us make these comparisons more direct.
Weakness #1 / Question #1. Memory inheritance beyond recurrence
Thank you for identifying this distinction. Your feedback helped us formulate the control that directly tests inheritance. The original “no handoff” contrast changes event-step output attenuation; both arms retain memory inheritance. It therefore does not isolate successor-memory transfer, as clarified in the revised Table 3 caption. The new control resets only successor memories at split/merge events while retaining recurrence elsewhere, the scheduler rule, attenuation, training budget, and checkpoint-selection rule. Matched retraining at γ = 0.25 uses three fitted seeds and all 300 test trajectories. Inheritance improves both metrics in every seed:
The earlier 21.0% contrast tests the value of persistent memory; this successor-only control tests whether that memory should be retained when the representation reorganizes. Its benefit therefore cannot be attributed merely to adding recurrence.
We separately report two fixed-weight diagnostics. In the output-discontinuity diagnostic, a matched parent-topology sham defines the reference learned acceleration. The relative output jump falls from 0.025 to 0.020 for splits and from 0.040 to 0.030 for merges, i.e., reductions of 20% and 25%. The jump is the RMS difference in pre-attenuation learned acceleration relative to the sham, normalized by sham RMS with a training-derived floor.
The subsequent-error diagnostic below forks the same checkpoint and pre-event state, applies the same topology transformation, and resets only successor memory before the common message/memory update. Its nonzero event coefficient, γ = 0.25, avoids immediate equality caused by suppressing the event-step learned output:
The pre-event gap is zero because the branches start from the same state. At offset 10, inheritance lowers error by 6.1% for splits and 5.2% for merges. Repeated successor resets increase 100-step NRMSE from 0.263 to 0.285; equivalently, inheritance lowers error by 7.7%. These diagnostics complement the retrained successor-only control by measuring event discontinuity and later rollout consequences directly.
Weakness #2 / Question #2. Scheduler sensitivity and event attenuation
We appreciate your careful examination of the scheduler. The full model retains its mean advantage when event attenuation is completely disabled. On the same 32 trajectories and three frozen fitted seeds, the one-factor sensitivity results are:
Fixed-K gives 0.2711. With γ = 1, NWD still lowers mean error by 10.3%. Thus, the full adaptive model's advantage persists without event-step suppression. Separately, the successor-reset experiment isolates inheritance at fixed γ = 0.25. These controls distinguish adaptive allocation, inherited context, and output attenuation. At γ = 0, memory refresh, known forcing, and physical integration continue; only the event-step learned output is suppressed. A learned gate over legal events gives 0.2290 under the same event/world budget, showing that the inheritance interface also supports learned decisions.