pith. sign in

Scalable parallel algorithm for graph neural network interatomic potentials in molecular dynamics simulations

8 Pith papers cite this work. Polarity classification is still indexing.

8 Pith papers citing it

citation-role summary

method 2

citation-polarity summary

years

2026 7 2025 1

roles

method 2

polarities

use method 2

clear filters

representative citing papers

GFFMERGE: Efficient Merging of Graph Neural Force Fields and Beyond

cs.LG · 2026-06-02 · unverdicted · novelty 7.0

GFFMERGE formulates GNN force field merging as a convex embedding-alignment problem with an analytical solution, recovering near joint-training performance on MD17, MD22, LiPS20 and other benchmarks while delivering 5-27x speedups.

Speculative Sampling For Faster Molecular Dynamics

cs.LG · 2026-06-01 · unverdicted · novelty 7.0

LSD extends speculative sampling to second-order Langevin dynamics, achieving 3-9x speedup in MD while exactly sampling from the target distribution without relative error.

Compact SO(3) Equivariant Atomistic Foundation Models via Structural Pruning

cs.LG · 2026-05-09 · unverdicted · novelty 6.0

Structural pruning of SO(3) equivariant atomistic models from large checkpoints yields 1.5-4x fewer parameters and 2.5-4x less pre-training compute than small models trained from scratch, while outperforming them on most Matbench Discovery metrics and downstream tasks.

citing papers explorer

Showing 2 of 2 citing papers after filters.

  • Teaching Molecular Dynamics to a Non-Autoregressive Ionic Transport Predictor cs.LG · 2026-05-10 · unverdicted · none · ref 2

    Non-autoregressive ionic transport predictor learns dynamics from auxiliary trajectory data during training only, achieving over 200x speedup versus autoregressive models and lower error than non-autoregressive baselines on both dataset types.

  • Compact SO(3) Equivariant Atomistic Foundation Models via Structural Pruning cs.LG · 2026-05-09 · unverdicted · none · ref 3

    Structural pruning of SO(3) equivariant atomistic models from large checkpoints yields 1.5-4x fewer parameters and 2.5-4x less pre-training compute than small models trained from scratch, while outperforming them on most Matbench Discovery metrics and downstream tasks.