- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces DistMLIP2, an inference platform that allows running several popular machine learning interatomic potentials, or machine learning force fields, across many GPUs, with new improvements to improve speed and the scale of systems that can be run. They compare against other distributed inference methods on several simulation systems.
Critical strengths
This paper introduces an update to DistMLIP that includes multiple additional optimizations that show improvements in inference efficiency and capacity over existing implementations. This release also integrates multiple different MLIPs into one distributed inference platform, with MACE, NequIP, UMA, and Orbv3, which have not previously been integrated into one framework.
Critical weaknesses
This paper doesn't include error bounds, estimates, or uncertainties for the timing and capacity information that's been reported. Given that each of these factors can vary significantly system to system, and vary even for multiple runs of the same system, it makes it difficult to assess with confidence the significance of various performance improvements.
Second, the described approach for partial graph reconstruction seems a bit unclear in its current description, and potentially incorrect. When reference coordinates are reset for dirty atoms but the edges are kept for clean atoms, how does this interact with the fact that references might be updated asynchronously? Couldn't this result in interactions between atoms that move substantially being missed, at least in the description written right now?
Finally, while this paper makes strong claims about performance improvements and capacity improvements, Table 2 is the only table that directly compares to other distributed inference approaches, and here the exact setup of each simulation and each condition for each result is unclear. How many atoms was each system run under? Are all methods timed under identical conditions? What's the precise set of timings and their boundaries being measured -- wall clock or something else? How well are the options available for each method tuned? These questions make it difficult to actually compare the cost-performance trade-off across distributed settings for different systems, a central claim of the paper. This is especially important given that unlike what's claimed in the text, Figure 3B does actually seem to show that time cost increases substantially for MACE, and visibly for NequIP based on partition cycles per node. For full assessment, these details will be helpful.
Questions for authors
How exactly is timing being measured and defined? How many different times were these systems run, and how condition dependent are the results? How were baseline settings optimized? Can matched baseline results (or at least a baseline result) be provided to the strong and weak scaling curves? How are these results expected to change on different hardware with different memory bandwidth and compute core differences?
3 comments
Author Response 2
Second, the described approach for partial graph reconstruction seems a bit unclear in its current description, and potentially incorrect. When reference coordinates are reset for dirty atoms but the edges are kept for clean atoms, how does this interact with the fact that references might be updated asynchronously? Couldn't this result in interactions between atoms that move substantially being missed, at least in the description written right now?
Interactions between atoms that move substantially are not missed. This is because edges are only kept for clean atoms if there are no adjacent dirty atoms. Every dirty atom causes a double-sided edge update to and from all neighboring atoms, including clean atoms. This holds true even when the clean and dirty atoms are in different partitions. Therefore, our edges are always correctly maintained despite asynchronous updates of reference positions. We outline this in section 3.2, but we will clarify this further in the final draft.
In order to empirically show correctness, we performed additional experiments looking at energy discrepancies for partial graph reconstructions when compared to single GPU, full graph baselines. We find that the differences are indeed identical and within floating-point precision.
| System | GPUs | Max Energy discrepancy (eV/atom) | Max force discrepancy (eV/Å) |
|---|---|---|---|
| Li₃PO₄ | 2 | 2.1300e-08 | 5.7220e-06 |
| Li₃PO₄ | 4 | 2.1175e-08 | 5.9605e-06 |
| Li₃PO₄ | 8 | 1.2397e-08 | 5.9605e-06 |
| Li₃PO₄ | 16 | 1.2952e-08 | 6.1989e-06 |
The above table shows the max energy and force errors for MACE + DistMLIP2 of the partial graph reconstruction compared to a single GPU, full graph reconstruction baseline. We ran each system three times, each for 10k steps at 0.5 fs timesteps. Temperature is 1000 K. Energy discrepancies consistently hover around 10e-9 eV/atom while force discrepancies hover around 10e-6 eV/angstrom.
Finally, while this paper makes strong claims about performance improvements and capacity improvements, Table 2 is the only table that directly compares to other distributed inference approaches, and here the exact setup of each simulation and each condition for each result is unclear. How many atoms was each system run under?
The exact atomic counts can be found in Table 2 under the columns denoted “C”. The C column represents the capacity of the simulation in millions of atoms as mentioned in the caption of Table 2.
Are all methods timed under identical conditions? What's the precise set of timings and their boundaries being measured -- wall clock or something else?
In Section 4.2, we discuss the timing conditions – we benchmark 100 steps of MD after 10 GPU warmup steps. These are complete end-to-end simulation measurements and are the most realistic timing setting for real world simulation use cases.
How well are the options available for each method tuned? These questions make it difficult to actually compare the cost-performance trade-off across distributed settings for different systems, a central claim of the paper.
The inference options for each of the baselines are found in Table 6 in the appendix. We used the fastest available inference settings for each of the models (e.g. flash-UMA’s Triton kernels, cuEquivariance, torch compile, OpenEquivariance) for the most realistic and fair head to head comparisons. Our results solidly emphasize DistMLIP2’s pareto dominance compared to the strongest possible baselines.
This is especially important given that unlike what's claimed in the text, Figure 3B does actually seem to show that time cost increases substantially for MACE, and visibly for NequIP based on partition cycles per node. For full assessment, these details will be helpful.
As mentioned in Section 4.2 and the Figure 3 caption, the Figure 3 results are for our partition cycling experiments – these are fundamentally a different feature proposed and implemented into DistMLIP2 that is used to increase the overall simulation capacity given a fixed GPU memory budget. Naturally, the increase in overall capacity implies more computation required to calculate energy and forces. Hence the increase in simulation time. We want to emphasize, however, that the partition cycling results in Figure 3b are showcasing a completely different feature and are not to be compared to the results in Table 2, which highlight the primary distributed inference capabilities of DistMLIP2.
If you have any further questions on this, please do let us know so we can get them sorted out. Partition cycling is a novel feature that is enabled by our hierarchical partitioning strategy only to be used within constrained GPU memory settings. For standard distributed inference settings and comparisons, we would like to point you to Table 2.
Author Response 3
How exactly is timing being measured and defined? How many different times were these systems run, and how condition dependent are the results? How were baseline settings optimized? Can matched baseline results (or at least a baseline result) be provided to the strong and weak scaling curves? How are these results expected to change on different hardware with different memory bandwidth and compute core differences?
As mentioned in Section 4.2, we perform 10 warmup MD steps for the GPU before timing 100 MD steps. This is the standard protocol followed in previous works [1-3]. For this work, we only had access to H100 GPUs; however, we expect scaling curves to perform similarly for different hardware and chipsets up to a first order approximation. Because we matched compute, atomic system, and used the fastest inference settings across all experiments and baselines, we also expect DistMLIP2 to continue being the state of the art system in capacity and runtime even when run on different hardware.
For a comparison against a baseline method, we run weak and strong scaling against ALCHEMI using the MACE model. For reference, we also include the DistMLIP2 + MACE results:
| GPUs | Weak: ALCHEMI | Weak: DistMLIP2 | Strong: ALCHEMI | Strong: DistMLIP2 |
|---|---|---|---|---|
| 1 | 75.060 | 75.628 | 419.677† | 411.750 |
| 2 | 93.017 | 78.392 | 254.868 | 213.341 |
| 4 | 105.133 | 80.491 | 150.027 | 112.051 |
| 8 | 125.894 | 80.466 | 98.634 | 61.900 |
| 16 | 175.667 | 85.937 | 82.780 | 41.186 |
| 32 | 211.154 | 94.550 | 72.738 | 39.696 |
DistMLIP2’s strong scaling and weak scaling is 1.8x and 2.2x more efficient, respectively, than ALCHEMI’s.
[1] DistMLIP: A Distributed Inference Platform for Machine Learning Interatomic Potentials, ICLR 2026, https://arxiv.org/abs/2506.02023
[2] Scalable Parallel Algorithm for Graph Neural Network Interatomic Potentials in Molecular Dynamics Simulations, JCTC 2024, https://pubs.acs.org/jctcce/article-abstract/20/11/4857/169287/Scalable-Parallel-Algorithm-for-Graph-Neural
[3] Scalable foundation interatomic potentials via message-passing pruning and graph partitioning, npj Computational Materials, https://www.nature.com/articles/s41524-026-02001-4
Once again, we would like to thank you for the review and hope we were able to alleviate each of your concerns! We hope we were able to establish DistMLIP2 as the de facto state of the art distributed MLIP inference platform. If you have any further questions, please let us know!
Author Response 1
We would like to thank the reviewer for the review! We’re pleased to see that you enjoyed our optimizations showing “improvements in inference efficiency and capacity over existing implementations”. Here are our point-by-point responses to your questions.
In the following table, we show the 25th percentile and 75th percentile bounds for our major timing results:
The table shows that the timing metrics are almost always quite tight. In fact, DistMLIP2 has a more consistent timing spread of 0.88% across runs while the average of all other methods is 3.36%.
We will include this table in the manuscript.
For the capacity results, we slowly increased the number of atoms in the supercell by a fixed interval until the GPU went out of memory. As a result, there is no notion of uncertainty or error in this metric. However, there does exist variance in the overall capacities due to node densities and edge counts that arise from simulating different systems. This is why we benchmarked 5 different real-world systems (H2O ice, Li3PO4, GaN, a metal organic framework, and a capsid protein) to show DistMLIP2 pareto dominates previous methods across all systems and models.