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.

169,291 papers · 148 categories

Trend · papers per month

6121824 · Jun 202019922001200920182026
48 results for nonautonomous ODE

Study financial contagion in networks using low-rank approximations and graphons.

problem Modeling distress contagion in heterogeneous financial networks.
method Rank-K factorization, nonautonomous ODE, transport representation, graphon limits.
result Established well-posedness and stability for contagion models in various settings.

Study mass transport in low-diffusivity using Lagrangian coordinates.

problem Mass preserving transport of passive tracers in low-diffusivity limit.
method Lagrangian coordinates, time-averaged diffusion equation, weighted manifold structure.
result Leading order asymptotics extend to dominant nontrivial singular value in low-diffusivity limit.

A new model uses Toeplitz matrices to analyze time-series data transitions.

problem Analyzing transitions in time-series data from nonautonomous systems.
method Deep Koopman-layered models with learnable Toeplitz matrices, leveraging Toeplitz matrices' universal property.
result The model demonstrates universality and generalization, outperforming existing methods.

Study on uniquely determining thermal properties from boundary temperature and heat flux measurements.

problem Determine thermal conductivity and volumetric heat capacity from boundary measurements.
method Uniqueness proof for isotropic and anisotropic media under thermal diffusivity assumption.
result Uniqueness of thermal properties in all dimensions and up to a gauge in two dimensions.

We address the problem of constructing numerical integrators for nonholonomic Lagrangian systems that enjoy appropriate discrete versions of the geometric properties of the continuous flow, including the preservation of energy. Building on previous work on time-dependent discrete mechanics, our approach is based on a d…

2002-09-24abs ↗pdf ↗

We prove a spectral flow formula for one-parameter families of Hamiltonian systems under homoclinic boundary conditions, which relates the spectral flow to the relative Maslov index of a pair of curves of Lagrangians induced by the stable and unstable subspaces, respectively. Finally, we deduce sufficient conditions fo…

2014-06-14abs ↗pdf ↗

New geometric framework for non-conservative field theories with time-dependent terms.

problem Describing non-conservative field theories with explicit space-time dependence.
method Combining k-cosymplectic and k-contact formulations to develop Hamiltonian and Lagrangian formalisms.
result Illustrated with the nonlinear damped wave equation, demonstrating the new formalism's applicability.

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.

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.

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.

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.

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 ↗

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.

ODENets are more robust to perturbations and adversarial attacks compared to CNNs.

problem Robustness of neural ODEs in the face of perturbations and adversarial attacks.
method Empirical study and theoretical analysis of ODENets' robustness properties.
result ODENets are more robust to random Gaussian perturbations and adversarial attacks compared to CNNs.

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.

Study estimates and predicts dynamic traffic OD flows for improved DTA models.

problem Estimating and predicting time-varying OD trip tables for dynamic traffic assignment.
method Bi-level optimisation for OD flow estimation and time series prediction for OD demand.
result High capability of proposed OD demand estimation method to reduce DTA model error.