Weight-Parameterization in Continuous Time Deep Neural Networks for Surrogate Modeling
Not on the map. Why?
Abstract (arXiv)
Continuous-time deep learning models, such as neural ordinary differential equations (ODEs), offer a promising framework for surrogate modeling of complex physical systems. A central challenge in training these models lies in learning expressive yet stable time-varying weights, particularly under computational constraints. This work investigates weight parameterization strategies that constrain the temporal evolution of weights to a low-dimensional subspace spanned by polynomial basis functions. We evaluate both monomial and Legendre polynomial bases within neural ODE and residual network (ResNet) architectures under discretize-then-optimize and optimize-then-discretize training paradigms. Experimental results across three high-dimensional benchmark problems show that Legendre parameterizations yield more stable training dynamics, reduce computational cost, and achieve accuracy comparable to or better than both monomial parameterizations and unconstrained weight models. These findings elucidate the role of basis choice in time-dependent weight parameterization and demonstrate that using orthogonal polynomial bases offers a favorable tradeoff between model expressivity and training efficiency.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 18 of its 31 references that are in the map. First posted on arXiv 29 Jul 2025.
Builds on
18 of 31 references.
References · 18
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operatorscited by 1,965
- 2017Stable Architectures for Deep Neural Networkscited by 340
- 2019Symplectic ODE-Net: Learning Hamiltonian Dynamics with Controlcited by 183
- 2020Dissecting Neural ODEscited by 150
- 2017Orthogonal Weight Normalization: Solution to Optimization over Multiple Dependent Stiefel Manifolds in Deep Neural Networkscited by 92
- 2019ANODE: Unconditionally Accurate Memory-Efficient Gradients for Neural ODEscited by 83
- 2017On orthogonality and learning recurrent networks with long term dependenciescited by 82
- 2019Deep Learning via Dynamical Systems: An Approximation Perspectivecited by 78
- 2020Discretize-Optimize vs. Optimize-Discretize for Time-Series Regression and Continuous Normalizing Flowscited by 36
- 2019Deep learning as optimal control problems: models and numerical methodscited by 33
6 more
- 2020Train Like a (Var)Pro: Efficient Training of Neural Networks with Variable Projectioncited by 12
- 2024Predicting Change, Not States: An Alternate Framework for Neural PDE Surrogatescited by 8
- 2020Time Dependence in Non-Autonomous Neural ODEscited by 7
- 2024Differential Equations for Continuous-Time Deep Learningcited by 7
- 2021Spline parameterization of neural network controls for deep learningcited by 3
- 2025NeuralPDR: Neural Differential Equations as surrogate models for Photodissociation Regionscited by 1
Built on by
Not cited yet.