Predicting symbolic ODEs from multiple trajectories

• URL: http://arxiv.org/abs/2510.23295v1
• Date: Mon, 27 Oct 2025 13:03:29 GMT
• Title: Predicting symbolic ODEs from multiple trajectories
• Authors: Yakup Emre Şahin, Niki Kilbertus, Sören Becker,
• Abstract summary: MIO is a transformer-based model for inferring symbolic ordinary differential equations.<n>We investigate different instance aggregation strategies and show that even simple mean aggregation can substantially boost performance.
• Score: 8.62509610565109
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce MIO, a transformer-based model for inferring symbolic ordinary differential equations (ODEs) from multiple observed trajectories of a dynamical system. By combining multiple instance learning with transformer-based symbolic regression, the model effectively leverages repeated observations of the same system to learn more generalizable representations of the underlying dynamics. We investigate different instance aggregation strategies and show that even simple mean aggregation can substantially boost performance. MIO is evaluated on systems ranging from one to four dimensions and under varying noise levels, consistently outperforming existing baselines.

Related papers

• Expressive Symbolic Regression for Interpretable Models of Discrete-Time Dynamical Systems [0.0]
  Symbolic Artificial Neural Network-Trained Expressions (SymANNTEx) architecture for this task. We show that our modified SymANNTEx model properly identifies single-state maps and achieves moderate success in approximating a dual-state attractor.
  arXiv  Detail & Related papers  (2024-06-05T05:05:29Z)
• On the Trajectory Regularity of ODE-based Diffusion Sampling [79.17334230868693]
  Diffusion-based generative models use differential equations to establish a smooth connection between a complex data distribution and a tractable prior distribution. In this paper, we identify several intriguing trajectory properties in the ODE-based sampling process of diffusion models.
  arXiv  Detail & Related papers  (2024-05-18T15:59:41Z)
• ODEFormer: Symbolic Regression of Dynamical Systems with Transformers [47.75031734856786]
  We introduce ODEFormer, the first transformer able to infer multidimensional ordinary differential equation (ODE) systems in symbolic form. We perform extensive evaluations on two datasets: (i) the existing "Strogatz" dataset featuring two-dimensional systems; (ii) ODEBench, a collection of one- to four-dimensional systems.
  arXiv  Detail & Related papers  (2023-10-09T09:54:12Z)
• Predicting Ordinary Differential Equations with Transformers [65.07437364102931]
  We develop a transformer-based sequence-to-sequence model that recovers scalar ordinary differential equations (ODEs) in symbolic form from irregularly sampled and noisy observations of a single solution trajectory. Our method is efficiently scalable: after one-time pretraining on a large set of ODEs, we can infer the governing law of a new observed solution in a few forward passes of the model.
  arXiv  Detail & Related papers  (2023-07-24T08:46:12Z)
• Dynamic Latent Separation for Deep Learning [67.62190501599176]
  A core problem in machine learning is to learn expressive latent variables for model prediction on complex data. Here, we develop an approach that improves expressiveness, provides partial interpretation, and is not restricted to specific applications.
  arXiv  Detail & Related papers  (2022-10-07T17:56:53Z)
• Leveraging redundancy in attention with Reuse Transformers [58.614198953733194]
  Pairwise dot product-based attention allows Transformers to exchange information between tokens in an input-dependent way. A typical Transformer model computes such pairwise attention scores repeatedly for the same sequence. We propose a novel architecture that reuses attention scores computed in one layer in multiple subsequent layers.
  arXiv  Detail & Related papers  (2021-10-13T16:08:02Z)
• Inferring the Structure of Ordinary Differential Equations [12.202646598683888]
  We extend the approach by (Udrescu et al., 2020) called AIFeynman to the dynamic setting to perform symbolic regression on ODE systems. We compare this extension to state-of-the-art approaches for symbolic regression empirically on several dynamical systems for which the ground truth equations of increasing complexity are available.
  arXiv  Detail & Related papers  (2021-07-05T07:55:05Z)
• Improving the Reconstruction of Disentangled Representation Learners via Multi-Stage Modeling [54.94763543386523]
  Current autoencoder-based disentangled representation learning methods achieve disentanglement by penalizing the ( aggregate) posterior to encourage statistical independence of the latent factors. We present a novel multi-stage modeling approach where the disentangled factors are first learned using a penalty-based disentangled representation learning method. Then, the low-quality reconstruction is improved with another deep generative model that is trained to model the missing correlated latent variables.
  arXiv  Detail & Related papers  (2020-10-25T18:51:15Z)
• Relational State-Space Model for Stochastic Multi-Object Systems [24.234120525358456]
  This paper introduces the relational state-space model (R-SSM), a sequential hierarchical latent variable model. R-SSM makes use of graph neural networks (GNNs) to simulate the joint state transitions of multiple correlated objects. The utility of R-SSM is empirically evaluated on synthetic and real time-series datasets.
  arXiv  Detail & Related papers  (2020-01-13T03:45:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.