Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

209418627836 · Jun 202019922001200920172026
48 results for Modulated Neural ODEs

Paper introduces a neural framework for accurate energy forecasting.

problem Challenges of forecasting energy demand and supply due to variability of renewable sources and dynamic consumption patterns.
method Integrates Neural ODEs, graph attention, multi-resolution wavelet transformations, and adaptive learning of frequencies.
result Consistently outperforms state-of-the-art baselines in various forecasting metrics across diverse datasets.

We show that Neural Ordinary Differential Equations (ODEs) learn representations that preserve the topology of the input space and prove that this implies the existence of functions Neural ODEs cannot represent. To address these limitations, we introduce Augmented Neural ODEs which, in addition to being more expressive…

2019-04-02abs ↗pdf ↗

This paper uses ODE to improve RNN models for time series data.

problem Improving RNN models for irregularly sampled time series data.
method Extending RNNs with Neural Ordinary Differential Equations (ODEs).
result New ODE-based RNN models reduce training and evaluation time.

In this paper we propose the use of continuous residual modules for graph kernels in Graph Neural Networks. We show how both discrete and continuous residual layers allow for more robust training, being that continuous residual layers are those which are applied by integrating through an Ordinary Differential Equation …

2019-11-21abs ↗pdf ↗

Improved neural-ODE for faster convergence and stability.

problem Stability, consistency, and convergence issues in neural-ODE solvers.
method Proposed a first-order Nesterov's accelerated gradient (NAG) based ODE-solver.
result Efficacy demonstrated in three tasks: supervised classification, density estimation, and time-series modelling.

New method sparsifies hybrid neural ODEs for better performance and stability.

problem Excessive latent states and interactions from mechanistic models lead to training inefficiency and over-fitting.
method Automatic state selection and structure optimization combining domain-informed graph modifications with data-driven regularization.
result Improved predictive performance and robustness with desired sparsity.

Generalization bounds derived for neural ODEs and deep residual networks.

problem Understanding the generalization capability of neural ODEs and deep residual networks.
method Lipschitz-based argument and analogy with deep residual networks.
result A generalization bound involving the magnitude of weight matrix differences.

New ODE solvers improve training efficiency and accuracy.

problem Training Neural ODEs requires efficient and accurate gradient calculation.
method Presented algebraically reversible ODE solvers that are time and memory efficient, calculate exact gradients, and are numerically stable.
result Reversible solvers strictly improve upon previous architectures in efficiency and accuracy.

Neural ODEs' performance varies with numerical method, requiring adaptive step size control.

problem Neural ODEs' performance depends on the numerical method used during training.
method Proposes an adaptive step size control algorithm to ensure a valid ODE without increasing computational cost.
result Valid Neural ODEs require careful numerical method selection and step size adaptation.

Neural ordinary differential equations (ODEs) have been attracting increasing attention in various research domains recently. There have been some works studying optimization issues and approximation capabilities of neural ODEs, but their robustness is still yet unclear. In this work, we fill this important gap by expl…

2019-10-12abs ↗pdf ↗

Stochastic neural ODEs outperform deterministic ones on image classification tasks.

problem Improving generalization in continuous-time models like neural ODEs.
method Empirical study of stochastically regularized neural ODEs using SDEs.
result Data augmentation negates the benefits of stochastic regularization, making neural ODEs and SDEs nearly equivalent.

HomoODE connects DEQs and Neural ODEs via homotopy continuation, improving accuracy and memory efficiency.

problem Connecting DEQs and Neural ODEs for better model performance and efficiency.
method Established a connection between DEQs and Neural ODEs using homotopy continuation, proposing HomoODE.
result HomoODE outperforms existing implicit models in accuracy and memory consumption.

It has been observed that residual networks can be viewed as the explicit Euler discretization of an Ordinary Differential Equation (ODE). This observation motivated the introduction of so-called Neural ODEs, which allow more general discretization schemes with adaptive time stepping. Here, we propose ANODEV2, which is…

2019-06-10abs ↗pdf ↗

The paper investigates how activation functions impact the training of Neural ODEs, leading to global convergence.

problem Challenges in training Neural ODEs, particularly gradient computation accuracy and convergence analysis.
method Investigates the impact of activation functions on the training dynamics of Neural ODEs.
result Establishes global convergence of Neural ODEs under gradient descent in overparameterized regimes.

Neural Jump ODE improves continuous-time prediction and filtering of irregularly sampled time series.

problem Theoretical guarantees for continuous-time prediction and filtering of irregularly observed time series.
method Introducing Neural Jump ODE (NJ-ODE) that models conditional expectation between observations with neural ODEs and jumps.
result Theoretical guarantees for the L2L^2-optimal prediction are provided, showing convergence of model output to optimal prediction.

A new method for estimating uncertainties in neural ODEs without numerical integration.

problem Accurate estimation of predictive uncertainties in neural ODEs.
method Distributional Gradient Matching (DGM) algorithm that jointly trains a smoother and a dynamics model.
result Significantly more accurate predictions compared to traditional methods.

Balanced Neural ODEs combine VAEs and Neural ODEs for efficient time series modeling.

problem Efficiently modeling systems with time-varying inputs and varying complexity.
method Combines VAEs for dimensionality reduction and Neural ODEs for dynamics, using variational parameters to adaptively learn.
result Balanced Neural ODEs (B-NODE) efficiently approximate Koopman operator without predefined dimensionality.

Hypersolvers enable fast continuous-depth models for practical applications.

problem Infinite-depth models like Neural ODEs are computationally infeasible for large problems.
method Introducing hypersolvers, neural networks that solve ODEs efficiently with theoretical guarantees.
result Hypersolvers achieve comparable inference time to traditional discrete networks, making continuous-depth models practical.

Deep ResNets exhibit distinct scaling properties with depth, challenging neural ODE models.

problem Understanding the scaling properties of deep ResNets and their relation to neural ODEs.
method Detailed numerical experiments on weights trained by stochastic gradient descent.
result Deep ResNets can exhibit different scaling regimes, including stochastic differential equations or neither, challenging the neural ODE model.

Neural ODEs simplified using Chen-Fliess series for Rademacher complexity analysis.

problem Analyzing the complexity of neural ODE models.
method Using Chen-Fliess series to frame neural ODEs as infinite-width nets, where weights are signature of control input and features are Lie derivatives.
result Derived compact expressions for the Rademacher complexity of ODE models.

This paper compares two methods for training neural ODEs in time-series regression and CNFs.

problem Training neural ODEs for time-series regression and CNFs efficiently.
method Discretize-Optimize (Disc-Opt) vs. Optimize-Discretize (Opt-Disc) approaches.
result Disc-Opt methods can achieve similar performance as Opt-Disc at inference with drastically reduced training costs.

Neural Jump ODEs improve online filtering and classification with robust performance.

problem Online filtering and classification in settings with irregular and partial observations.
method Modeling conditional expectation using Neural Jump ODEs, with theoretical convergence guarantees.
result Demonstrated superior performance over classical methods, especially in complex scenarios.

Neural Ordinary Differential Equation (Neural ODE) has been proposed as a continuous approximation to the ResNet architecture. Some commonly used regularization mechanisms in discrete neural networks (e.g. dropout, Gaussian noise) are missing in current Neural ODE networks. In this paper, we propose a new continuous ne…

2019-06-05abs ↗pdf ↗