arXiv Machine Learning

Continuous-Time Piecewise-Linear Recurrent Neural Networks

arXiv:2602. 15649v2 Announce Type: replace Abstract: In dynamical systems reconstruction (DSR) we aim to recover the dynamical system (DS) underlying observed time series.

arXiv AI
Sep 25

ELiSe: Efficient Learning of Sequences in Structured Recurrent Networks

The paper introduces ELiSe, a model that leverages cortical network scaffolds and dendritic compartments to learn complex non‑Markovian spatio‑temporal patterns using only local, always‑on, phase‑free synaptic plasticity. It demonstrates the model’s ability to acquire and replay intricate sequences, exemplified by a birdsong learning mock‑up, and shows robustness to external disturbances and flexibility in parameter settings.

By Laura Kriener, Kristin V\"olk, Ben von H\"unerbein, Federico Benitez, Walter Senn, Mihai A. Petrovici
arXiv Machine Learning
Jun 4

Drift-Diffusion Matching: Embedding dynamics in latent manifolds of asymmetric neural networks

arXiv:2602. 14885v2 Announce Type: replace-cross Abstract: Recurrent neural networks (RNNs) provide a theoretical framework for understanding computation in biological neural circuits, yet classical results, such as Hopfield's model of associative memory, rely on symmetric connectivity that restricts network dynamics to gradient-like flows.

By Ram\'on Nartallo-Kaluarachchi, Renaud Lambiotte, Alain Goriely
arXiv Machine Learning
Sep 16

Neural Stochastic Differential Equations on Compact State Spaces: Theory, Methods, and Application to Suicide Risk Modeling

The paper introduces a new class of stochastic differential equations (SDEs) whose solutions are guaranteed to stay within a specified compact polyhedral state space, addressing key limitations of existing SDE models for irregular, noisy, and partially observed ecological momentary assessment (EMA) data. It demonstrates that traditional chain‑rule constructions fail both theoretically and empirically, derives necessary constraints on drift and diffusion terms, and presents a parameterization that transforms arbitrary dynamics into constraint‑satisfying SDEs. Experiments on several real EMA datasets, including a large suicide‑risk study, show that this approach improves forecasting and optimization compared to standard latent neural SDE baselines, thereby enabling more trustworthy continuous‑time models for clinical time series.

By Malinda Lu, Yue-Jane Liu, Matthew K. Nock, Yaniv Yacoby
arXiv Machine Learning
Sep 15

Physics-Constrained Neural Surrogate for Domain Growth Prediction in Systems with Conserved Kinetics

The paper introduces a physics-constrained neural network surrogate that learns the microstructural evolution of binary mixtures governed by the Cahn‑Hilliard equation. By imposing conservation of the order parameter as a hard constraint on the network output, the model accurately predicts long‑time phase‑separation dynamics for both critical and off‑critical mixtures, maintaining mixture composition and matching the Lifshitz‑Slyozov domain‑growth law. A variant that enforces conservation only through a penalty term drifts from the initial composition and loses predictive accuracy over long rollouts, underscoring the necessity of the hard constraint for stability.

By Vijay Yadav, Pallvi Pandey, Madhu Priya, Manish Dev Shrimali, Prabhat K. Jaiswal
arXiv Machine Learning
Sep 4

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

The paper introduces a new method for simulating coupled dynamical systems that bypasses traditional time‑stepping. Instead of marching through time, each subsystem is represented by a neural surrogate that maps an entire driving trajectory and initial condition to a full output trajectory. Coupling is achieved by enforcing self‑consistency across these trajectories, turning the simulation into a fixed‑point problem over complete trajectories. Experiments on van der Pol oscillators and Hodgkin‑Huxley neuron networks show that only 4–10 Newton iterations are needed, compared to 1500 steps for a conventional integrator, and that the gradient can be computed without time recursion using GMRES. The spectral radius of the surrogate’s Jacobian predicts convergence, and the implicit gradient remains accurate even when unrolled backpropagation diverges.

By Liyu Zerihun, Mark Shinyoung Lee