Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCercetare AI

analiza aiqbench

This research establishes rigorous theoretical bounds for Neural ODEs, demonstrating that autonomous-flow-based generation can universally approximate diffeomorphisms and homeomorphisms with specific convergence rates dependent on parameter count and dimension. The study highlights a critical limitation where single autonomous flows fail to densely cover the space of such transformations in dimensions $d \ge 2$, necessitating compositions or alternative strategies for universal approximation. These findings advance the mathematical understanding of generative models' expressive power and their fundamental constraints within dynamical systems theory.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Autonomous-Flow-Based Generation

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2511.09902v3 Announce Type: replace 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 $\mathcal{O}(P^{-1/d})$ with $P$ 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 \ge 2$ . Under a compact-support$_\mathrm{id}$ condition on $(0,1)^d$, we show that using autonomous-flow-based generation, one can universally approximate compactly supported$_\mathrm{id}$ diffeomorphisms on $(0,1)^d$ for any dimension with rate $\mathcal{O}((\frac{P}{\log P})^{-2/d})$ with $P$ parameters and for compactly supported$_\mathrm{id}$ homeomorphisms on $(0,1)^d$ in dimension $d \geq 5$ with rate $\mathcal{O}(P^{-1/(d+1)})$ with $P$ parameters and by a composition of at most $I_d$ autonomous Neural ODEs with the same support$_\mathrm{id}$, where $I_d$ depends only on the dimension. Moreover, we show that the class of single autonomous flows compactly supported$_\mathrm{id}$ on $(0,1)^d$ is meagre in the space of compactly supported$_\mathrm{id}$ homeomorphisms on $(0,1)^d$ for $d\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$ with rate $\mathcal{O}(P^{-1/(d+1)})$ with $P$ parameters.

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 $\mathcal{O}(P^{-1/d})$ with $P$ 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 \ge 2$ . Under a compact-support$_\mathrm{id}$ condition on $(0,1)^d$, we show that using autonomous-flow-based generation, one can universally approximate compactly supported$_\mathrm{id}$ diffeomorphisms on $(0,1)^d$ for any dimension with rate $\mathcal{O}((\frac{P}{\log P})^{-2/d})$ with $P$ parameters and for compactly supported$_\mathrm{id}$ homeomorphisms on $(0,1)^d$ in dimension $d \geq 5$ with rate $\mathcal{O}(P^{-1/(d+1)})$ with $P$ parameters and by a composition of at most $I_d$ autonomous Neural ODEs with the same support$_\mathrm{id}$, where $I_d$ depends only on the dimension. Moreover, we show that the class of single autonomous flows compactly supported$_\mathrm{id}$ on $(0,1)^d$ is meagre in the space of compactly supported$_\mathrm{id}$ homeomorphisms on $(0,1)^d$ for $d\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$ with rate $\mathcal{O}(P^{-1/(d+1)})$ with $P$ parameters.

Machine Learning (cs.LG); Classical Analysis and ODEs (math.CA); Dynamical Systems (math.DS); Numerical Analysis (math.NA); Machine Learning (stat.ML)

arXiv:2511.09902 [cs.LG]

(or arXiv:2511.09902v3 [cs.LG] for this version)

Text integral sub licența deschisă a publicației · 208 cuvinte

Subiecte conexe