cs.LGFeb 16, 2026

PolyNODE: Variable-dimension Neural ODEs on M-polyfolds

Authors: Per Åhag, Alexander Friedrich, Fredrik Ohlsson, Viktor Vigren Näslund

Organizations: Department of Mathematics and Mathematical Statistics, Umeå University, Umeå, Sweden

Abstract

Neural ordinary differential equations (NODEs) are geometric deep learning models based on dynamical systems and flows generated by vector fields on manifolds. Despite numerous successful applications, particularly within the flow matching paradigm, all existing NODE models are fundamentally constrained to fixed-dimensional dynamics by the intrinsic nature of the manifold's dimension. In this paper, we extend NODEs to M-polyfolds (spaces that can simultaneously accommodate varying dimensions and a notion of differentiability) and introduce PolyNODEs, the first variable-dimensional flow-based model in geometric deep learning. As an example application, we construct explicit M-polyfolds featuring dimensional bottlenecks and PolyNODE autoencoders based on parametrised vector fields that traverse these bottlenecks. We demonstrate experimentally that our PolyNODE models can be trained to solve reconstruction tasks in these spaces, and that latent representations of the input can be extracted and used to solve downstream classification tasks. The code used in our experiments is publicly available at https://github.com/turbotage/PolyNODE .

Figures & tables

Appendix figures & tables4 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

May 11, 2026

Steerable Neural ODEs on Homogeneous Spaces

We introduce steerable neural ordinary differential equations on homogeneous spaces M=G/HM=G/H. These models constitute a novel geometric extension of manifold neural ordinary differential equations (NODEs) that transport associated feature vectors transforming under the local symmetry group HH. We interpret features as sections of associated vector bundles over MM, and describe their evolution as parallel transport. This results in a coupled system of ODEs consisting of a flow equation on MM and a steering equation acting on features. We show that steerable NODEs are GG-equivariant whenever the vector field generating the flow and the connection governing parallel transport are both GG-invariant. Furthermore, we demonstrate how steerable NODEs incorporate existing NODE models and continuous normalizing flows on Lie groups. Our framework provides the geometric foundation for learning continuous-time equivariant dynamics of general vector-valued features on homogeneous spaces.
May 14, 2026

Tadpole: Autoencoders as Foundation Models for 3D PDEs with Online Learning

We introduce Tadpole, a novel foundation model for three-dimensional partial differential equations (PDEs) that addresses key challenges in transferability, scalability to high dimensionality, and multi-functionality. Tadpole is pre-trained as an autoencoder on synthetic 3D PDE data generated by an efficient online data-generation framework. This enables large-scale, diverse training without storage or I/O overhead, demonstrated by scaling to an equivalent of hundreds of terabytes of training data. By autoencoding single-channel spatial crops, Tadpole learns rich and transferable representations across heterogeneous physical systems with varying numbers of state variables and spatial resolutions. Although pre-trained solely as an autoencoder, Tadpole can be efficiently applied for multiple downstream tasks beyond reconstruction, including dynamics learning and generative modeling. For dynamics learning, we propose a novel parameter-efficient fine-tuning strategy that integrates low-rank adaptation, latent-space transformations, and reintroduced skip connections, achieving accurate temporal modeling with a minimal number of trainable parameters. Tadpole demonstrates strong fine-tuning performance across various downstream tasks, highlighting its versatility and effectiveness as a foundation model for 3D PDE learning. Source code and pre-trained weights of Tadpole are available at https://github.com/tum-pbs/tadpole
Nov 13, 2025

Autonomous-Flow-Based Generation

We show that using autonomous-flow-based generation, one can universally approximate orientation-preserving diffeomorphisms defined on the cube by Neural ODEs with rate O(P−1/d)\mathcal{O}(P^{-1/d}) with PP parameters. On the other hand, we show that by using only a single autonomous flow, the class of Neural ODEs is nowhere dense on the cube in dimension d≥2d \ge 2 . Under a compact-supportid_\mathrm{id} condition on (0,1)d(0,1)^d, we show that using autonomous-flow-based generation, one can universally approximate compactly supportedid_\mathrm{id} diffeomorphisms on (0,1)d(0,1)^d for any dimension with rate O((Plog⁡P)−2/d)\mathcal{O}((\frac{P}{\log P})^{-2/d}) with PP parameters and for compactly supportedid_\mathrm{id} homeomorphisms on (0,1)d(0,1)^d in dimension d≥5d \geq 5 with rate O(P−1/(d+1))\mathcal{O}(P^{-1/(d+1)}) with PP parameters and by a composition of at most IdI_d autonomous Neural ODEs with the same supportid_\mathrm{id}, where IdI_d depends only on the dimension. Moreover, we show that the class of single autonomous flows compactly supportedid_\mathrm{id} on (0,1)d(0,1)^d is meagre in the space of compactly supportedid_\mathrm{id} homeomorphisms on (0,1)d(0,1)^d for d≥2d\ge 2. By linearly lifting the domain into one higher dimension, we obtain a universal approximation result for Lipschitz functions compactly supported on (0,1)d(0,1)^d with rate O(P−1/(d+1))\mathcal{O}(P^{-1/(d+1)}) with PP parameters.