Skip to content

Learning coarse-step dynamics and internal mechanical response with graph networks

Sep 2026 · 0 citations
Computer Science

TL;DR

Newmark-\b{eta}-DGN is introduced, a graph neural network-based framework that combines two structures inspired by computational mechanics that links coarse-step prediction to the inference of mechanical quantities that were never observed during training.

Abstract

Modern sensing records the motion of physical systems, but often leaves the forces and mechanical response governing that motion unobserved. Inferring these quantities from discretely sampled trajectories is especially difficult at coarse time scales, when mechanical response evolves between observations and interactions propagate across the system. Here we introduce Newmark-\b{eta}-DGN, a graph neural network-based framework that combines two structures inspired by computational mechanics. First, a semi-implicit update inspired by the Newmark-\b{eta} method uses learned momentum fluxes and matrix-valued response operators to advance the state over each observed interval. Second, an operator-weighted virtual hub provides system-wide coupling through a sparse set of connections. The learned quantities thus determine the predicted motion and remain accessible for mechanical analysis. Across a deformable beam, human motion and protein dynamics, Newmark-\b{eta}-DGN supports long-horizon prediction at time steps for which explicit learned simulators deteriorate. Without force, moment or constitutive relation supervision, forces inferred from walking kinematics track independently derived hip and knee joint moments, while response operators learned on the beam recover the relative spatial and directional structure of its finite-element stiffness tangent. Newmark-\b{eta}-DGN therefore links coarse-step prediction to the inference of mechanical quantities that were never observed during training.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

Discrete Action Matching: Learning Stochastic Dynamics from Samples via State Graphs

Learning population dynamics from unpaired temporal marginals is an ill-posed inverse problem that requires structural assumptions on the underlying dynamics. We introduce $\textit{Discrete Action Matching}$ (DAM), a finite-state counterpart of Action Matching based on discrete Wasserstein geometry. For a prescribed ma...

Mikhail Persiianov, A. Korotin · 0 citations
#machine learning Preprint Oct 2026

Simulation-Free Learning of Population Dynamics with Wasserstein Lagrangian Residuals

The dynamics of cells, organisms, and fluids are often modeled as probability distributions evolving over time. Reconstructing and extrapolating this evolution from unpaired snapshots requires assumptions about the underlying process. Wasserstein gradient flows are a common choice, but they cannot describe conservative...

F. Sergeev, Markus Heinonen, Daniel Waxman et al. · 0 citations
Review Oct 2026

Specialized machine learning force fields for materials dynamics

Machine learning interatomic potentials (MLIPs) are transforming atomistic simulations by accessing unprecedented length and time scales. While pretrained equivariant graph neural networks achieve robust zero-shot performance for near-equilibrium properties across broad chemical spaces, their translation to complex mat...

Yue Wu, Hao-Yu Wan, Yuan Tian et al. · 0 citations
Preprint Sep 2026

Decompose Dynamics Before Learning Dependencies in Spatiotemporal Systems

Relations in networked spatiotemporal systems are often learned from observations that entangle dynamics governed by different mechanisms, obscuring what evolves locally and how it propagates across nodes. We introduce Component-Aware Network Dynamics with Ordered Relations (CANDOR), which decomposes local dynamics bef...

Zi-Qi Wang, Dao-Jiang Hu, Cheng Bao et al. · 0 citations
Preprint Aug 2026

TracingFlow: A Simulation-Free Trajectory Inference Framework Based on Second-Order Dynamics

By using neural networks to regress the acceleration field, TracingFlow provides an exact, efficient solution to the Dynamical Optimal Acceleration Transport (DOAT) problem and recovers dynamical structures that are both mathematically optimal and biologically plausible.

Yuhao Sun, Zekun Wu, Zi-Xun Huang et al. · 0 citations
#machine learning Preprint Aug 2026

Propensity Straight-Through Gradients for Discrete Stochastic Systems

This work exploits the affine state update to obtain the exact one-step conditional-mean sensitivity by differentiating normalized reaction propensities, and defines the propensity straight-through (PST) estimator, a temperature- and Gumbel-free path to scalable gradient-based learning through exact stochastic trajecto...

Jose M. G. Vilar, Leonor Saiz · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.