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,742 papers · 148 categories

Trend · papers per month

9182635 · Jun 202619922001200920172026
48 results for Infinite-Dimensional ODE

We extend rectified flow to infinite-dimensional Hilbert space.

problem Extending rectified flow to infinite-dimensional spaces.
method Established a rigorous functional formulation using the superposition principle for continuity equations.
result Demonstrated superior performance compared to existing models.

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.

Existence of balanced embedding proved for complex manifold into infinite-dimensional space.

problem Balanced embedding of non-compact complex manifolds into infinite-dimensional projective space.
method Gradient flow in a Hilbert space, long-time existence established by perturbation, convergence depends on a priori bounds.
result Existence of balanced embedding proved in a model case.

In this paper we derive a scaling limit for an infinite dimensional limit order book model driven by Hawkes random measures. The dynamics of the incoming order flow is allowed to depend on the current market price as well as on a volume indicator. With our choice of scaling the dynamics converges to a coupled SDE-ODE s…

2017-09-05abs ↗pdf ↗

New method constructs confidence bands for ODE models with unknown regulatory effects.

problem Building confidence bands for ODE models with unknown regulatory relations is challenging.
method Localized kernel learning approach combined with de-biasing method.
result The constructed confidence band has the desired asymptotic coverage probability and accurately recovers the regulatory network.

Mathematical methods characterize RNNs' asymptotics as hidden units and data grow.

problem Characterize recurrent neural networks' behavior as hidden units and data grow.
method Developed mathematical methods to analyze RNNs' convergence to an infinite-dimensional ODE coupled with a fixed point of a random algebraic equation.
result RNNs converge to an infinite-dimensional ODE coupled with a fixed point of a random algebraic equation.

Derives scaling limits and fluctuations for SGD in high dimensions.

problem Understanding SGD behavior in high-dimensional settings with varying noise levels.
method Interacting particle system approach, treating SGD iterates as such, with covariance structure considered.
result Precise three-step phase transition observed in SGD behavior: ballistic, diffusive, then random.

We develop a second-order model for limit order books in a single scaling regime.

problem Modeling price and volume dynamics in a limit order book with market and limit orders at a common time scale.
method Established a first- and second-order approximation for an infinite dimensional limit order book model.
result Proved the existence and uniqueness of a solution for the second-order approximation.

In this paper we derive a second order approximation for an infinite dimensional limit order book model, in which the dynamics of the incoming order flow is allowed to depend on the current market price as well as on a volume indicator (e.g.~the volume standing at the top of the book). We study the fluctuations of the …

2017-08-24abs ↗pdf ↗

Paper proves convergence of Gini index to equilibrium in Wasserstein distance.

problem Proving convergence of Gini index to equilibrium in Wasserstein distance.
method Analyzes Gini index as Lyapunov functional and proves convergence in Wasserstein distance.
result Proves convergence of Gini index to equilibrium in Wasserstein distance.

NOs can learn any finite collection of classes in functional data.

problem Learning finite collections of classes in infinite-dimensional spaces.
method Proved sample-based neural operators can learn any finite collection of classes in an infinite-dimensional reproducing kernel Hilbert space.
result NOs can learn any finite collection of classes in an infinite-dimensional reproducing kernel Hilbert space, even when the classes are not convex or connected.

Time series with non-uniform intervals occur in many applications, and are difficult to model using standard recurrent neural networks (RNNs). We generalize RNNs to have continuous-time hidden dynamics defined by ordinary differential equations (ODEs), a model we call ODE-RNNs. Furthermore, we use ODE-RNNs to replace t…

2019-07-08abs ↗pdf ↗

Minimal surfaces in third-order ODEs identified for linear second-order ODEs.

problem Characterizing minimal surfaces in third-order ODEs.
method Analyzing submanifolds of third-order ODEs as Riemannian manifolds.
result Linear second-order ODEs with y=±y+β(x)y''=\pm y+β(x) are the only minimal surfaces and totally geodesic.

DALTON improves ODE parameter estimation by learning from noisy data.

problem High sensitivity to parameters in ODEs produces unreliable parameter estimates.
method Data-adaptive probabilistic likelihood approximation for ODEs.
result DALTON produces more accurate parameter estimates than existing methods.

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 uses Gaussian ODE filtering to approximate likelihoods for fast ODE inverse problems.

problem Intractable forward models in likelihood-free inference, especially for ODEs.
method Gaussian ODE filtering to construct local Gaussian likelihood approximations.
result New solvers outperform standard likelihood-free approaches on benchmark systems.

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 ↗

Paper analyzes convergence of ODE samplers in Wasserstein distances.

problem Limited theoretical understanding of convergence properties of probability flow ODEs.
method Convergence analysis for general probability flow ODEs in 2-Wasserstein distance.
result First non-asymptotic convergence analysis for probability flow ODE samplers.

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.

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.

The study identifies exceptions to fiber-preserving symmetry in ODEs and systems.

problem Identifying exceptions to fiber-preserving symmetry in ODEs and systems.
method Lie's classification of Lie algebras of vector fields, absolute and relative scalar differential invariants, conditional and vector-valued relative invariants, prolongations of actions.
result Examples of scalar ODEs and systems with symmetry groups not fiber-preserving.

New method combines ODE filters and numerical quadrature to propagate model uncertainty.

problem Propagation of model uncertainty in ODE solutions with uncertain parameters.
method Combining ODE filters with numerical quadrature.
result Effective propagation of both numerical and parametric uncertainty.

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.

We compute the characteristic Cartan connection associated with a system of third order ODEs. Our connection is different from Tanaka normal one, but still is uniquely associated with the system of third order ODEs. This allows us to find all fundamental invariants of a system of third order ODEs and, in particular, de…

2011-04-05abs ↗pdf ↗

Infinitesimal gradient boosting is a new algorithm derived from gradient boosting.

problem Improving the efficiency and smoothness of gradient boosting.
method Introduced a new class of randomized regression trees and used a limit process in vanishing-learning-rate asymptotic.
result Convergence of the stochastic algorithm and characterization of the limiting procedure as a unique solution of a nonlinear ODE.

This work improves likelihood of score-based diffusion ODEs using high-order denoising score matching.

problem The gap between maximum likelihood and score matching objectives for score-based diffusion ODEs.
method High-order denoising score matching to maximize likelihood.
result Score-based diffusion ODEs achieve better likelihood on synthetic and CIFAR-10 data.

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.

Solutions of an implicit ODE form a web. Already for cubic ODEs the 3-web of solutions has a nontrivial local invariant, namely the curvature form. Thus any local classification of implicit ODEs necessarily has functional moduli if no restriction on the class of ODEs is imposed. Here the most symmetric case of hexagona…

2008-08-04abs ↗pdf ↗

A systematic algorithm for building integrating factors of the form mu(x,y') or mu(y,y') for non-linear second order ODEs is presented. When such an integrating factor exists, the algorithm determines it without solving any differential equations. Examples of ODEs not having point symmetries are shown to be solvable us…

1997-11-27abs ↗pdf ↗