cs.LGDate pending

Autonomous-Flow-Based Generation

Authors: Hossein RouhvarziAnastasis Kratsios

Abstract

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(P1/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 d2d \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((PlogP)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 d5d \geq 5 with rate O(P1/(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 d2d\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(P1/(d+1))\mathcal{O}(P^{-1/(d+1)}) with PP parameters.

Explore similar work

May 11, 2026cond-mat.dis-nn

Exact Fixed-Point Constraints in Neural-ODEs with Provable Universality

We introduce a technique that enables Neural-ODEs to approximate arbitrary velocity fields with a priori planted fixed-points. Specifically, a recipe is given to explicitly accommodate for a finite collection of points in the reference multi-dimensional space of the Neural-ODE where the velocity field is exactly equal to zero. In this way, the gradient-based training is rigorously constrained inside the prescribed hypothesis class while leaving the expressive power of the Neural-ODE unaltered. We rigorously prove the universality of the Neural-ODE under any local constraints in the velocity field and give a computationally convenient way of imposing the fixed points. Our method is then tested on two paradigmatic physical models.
Feliciano Giuseppe Pacifico, Duccio Fanelli, Lorenzo Buffoni +3
May 11, 2026cs.LG

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.
Emma Andersdotter, Daniel Persson, Fredrik Ohlsson
Jun 22, 2026cond-mat.dis-nn

Approximating velocity fields with planted attractors via Neural-ODEs for classification purposes

In this work, Neural ODEs equipped with a curated collection of equilibrium points have been successfully employed for classification tasks. The planted attractors serve as indicators for the target classes, while the velocity field leveraging the universal approximation capabilities of the architecture shapes the dynamical landscape. This process defines the basins of attraction of the trained model, effectively directing each input (provided as an initial condition) toward its corresponding destination target.
Feliciano Giuseppe Pacifico, Duccio Fanelli, Lorenzo Buffoni +3