Skip to content

Time Without Timesteps: Simulating Coupled Dynamical Systems via Self-Consistency

Sep 2026 · 0 citations · 21 references
Computer Science

TL;DR

This work explores a different formulation for coupled systems, where a neural surrogate mapping a full driving trajectory and initial condition directly to a full output trajectory is trained and where surrogate error degrades it.

Abstract

Numerical simulation of dynamical systems is usually organized as a causal march through time: each state is computed from the previous one. We explore a different formulation for coupled systems. For each subsystem type we train a neural surrogate mapping a full driving trajectory and initial condition directly to a full output trajectory; following classical waveform relaxation, coupled systems are assembled by enforcing self-consistency among these trajectories: simulation becomes a fixed-point problem over complete trajectories rather than a stepwise rollout. On coupled van der Pol oscillators and Hodgkin-Huxley neuron networks, sequential depth becomes the number of solver iterations: 4-10 Newton iterations where the reference integrator takes 1500 steps. The gradient likewise loses its time recursion: it becomes a linear system solved by GMRES at memory independent of solver depth. A single scalar measured from the learned operator, the spectral radius of its Jacobian, predicts in advance where the coupled solve will converge; past that boundary, unrolled backpropagation diverges and a Neumann adjoint fails, while the implicit gradient remains correct to 0.04%. We report where the approach succeeds and where surrogate error degrades it.

View source

Similar papers

#machine learning Preprint Aug 2026

RAPTOR: RAndom-projection Physics-informed Transient sOlveR

The complexity of time-domain simulation of modern power systems has increased significantly because converter-based resources introduce control dynamics that must be simulated alongside slower system-level and fast electromagnetic dynamics. The resulting wide range of timescales may force classical time-domain solvers...

Petros Ellinas, Benjamin Vilmann, Spyros Chatzivasileiadis et al. · 0 citations
#machine learning Preprint Aug 2026

Learning PDE Time-Stepping with Neural Cellular Automata

This paper proposes a trainable Neural Cellular Automata (NCA) based surrogate model for learning long time PDE dynamics that achieves the lowest long-horizon relative errors on the majority of the experiments.

Esha Saha, Hao Wang · 0 citations
#machine learning Open access Sep 2026

Ostrich: Taking Large Strides Through Stiff Contact in Differentiable Dynamics

Ostrich is presented, a GPU-accelerated rigid-body simulator that resolves hard contacts and friction with non-smooth Newton iteration at large timesteps, and differentiates the converged residual via the implicit function theorem, reusing the forward Schur complement to compute the adjoint at O(1) memory per timestep.

A. Kučera, K. Zimmermann · 2 citations
Conference Open access 2026

Identification of Ordinary Differential Equation Surrogates from Numerical Integration with Adaptive Time-Step Schemes

An approach is presented where a neural network surrogate for the state function of the system is trained while being embedded into a numerical integration scheme with step-size control and may be finally used as a substitute for the unknown ODE under investigation.

Timo Bielitz, Dieter Bestle · 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
Preprint Sep 2026

Port-Hamiltonian Koopman Operator Synthesis for Mechanical Systems

This work presents a structure-preserving Koopman framework for Euler-Lagrange systems built on generalized-momentum coordinates, and demonstrates improved prediction accuracy, data efficiency, and closed-loop tracking over Koopman baselines, with increasing gains for higher-dimensional systems.

Rajpal Singh, Aditya Singh, J. Keshavan · 0 citations

Related blog posts

MIT News · Artificial Intelligence Nov 17, 2026

Learning the language of machine learning

By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

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