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

7152229 · Jun 202619922001200920172026
48 results for Lorentzian ODEs

We provide five examples of conformal geometries which are naturally associated with ordinary differential equations (ODEs). The first example describes a one-to-one correspondence between the Wuenschmann class of 3rd order ODEs considered modulo contact transformations of variables and (local) 3-dimensional conformal …

2004-06-21abs ↗pdf ↗

Study para-CR structures in 5D with degenerate Levi form, revealing geometric conditions for conic graphs and Lorentzian ODEs.

problem Investigate invariant properties of para-CR structures in 5D with degenerate Levi form.
method Analyze basic invariants and their vanishing conditions to establish geometric interpretations and necessary conditions.
result Vanishing of the third basic invariant N(G,H)0N(G,H) \equiv 0 implies contact projective geometries on quotient spaces.

Develops methods to construct harmonic and wave maps into variable-curvature surfaces.

problem Limited explicit constructions for harmonic and wave maps in variable-curvature settings.
method Reduction framework for pseudo-Riemannian surfaces, geometric ansatz, first-order ODEs.
result Constructs explicit harmonic and wave maps into ellipsoids, hyperboloids, and Schwarzschild exterior.

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.

In this article we study minimal flat Lorentzian surfaces in Lorentzian complex space forms. First we prove that, for minimal flat Lorentzian surfaces in a Lorentzian complex form, the equation of Ricci is a consequence of the equations of Gauss and Codazzi. Then we classify minimal flat Lorentzian surfaces in the Lore…

2013-07-15abs ↗pdf ↗

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 ↗

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 ↗

The paper explores solving inverse problems for ODEs with and without constraints.

problem Understanding when second order ODEs can represent Lagrangian models with or without constraints.
method Geometric techniques to address the inverse problem for both constrained and unconstrained systems of second order ODEs.
result The constrained case presents more ambiguities and complexities than the unconstrained one.

Parallel-in-time solver reduces ODE simulation time from linear to logarithmic.

problem Efficiently solving ordinary differential equations (ODEs) with reduced computational cost.
method Formulated a parallel-in-time probabilistic numerical ODE solver using time-parallel formulation of iterated extended Kalman smoothers.
result Reduces span cost from linear to logarithmic in the number of time steps.

Study of a series of Lorentzian structures on SL(2,R) with SO(1,1) symmetry.

problem Global optimality of extremal trajectories in a series of Lorentzian structures.
method Analysis of a one-parametric series of left-invariant Lorentzian structures on SL(2,R) with SO(1,1) symmetry.
result Properties of the Lorentzian structures deform to those of the sub-Lorentzian structure in a limit case.

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.

Bayesian ODEs with Gaussian processes infer unknown dynamics from data.

problem Estimating unknown continuous-time system dynamics from data.
method Bayesian nonparametric model using Gaussian processes, sparse variational inference, probabilistic shooting.
result Posterior predictive uncertainty scores outperform alternative methods on multiple ODE learning tasks.

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 ↗