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

Trend · papers per month

67135202269 · Jun 202019922001200920172026
48 results for time-dependent differential equations

Probabilistic method combines space and time uncertainties in PDEs.

problem Separate treatment of space and time in PDE solvers obscures interactions and error quantification.
method Gaussian process interpretation of finite difference methods interacting with probabilistic ODE solvers.
result Joint quantification of space- and time-uncertainty possible without sacrificing ODE solver performance.

The paper analyzes convergence of Langevin dynamics with time-dependent metrics.

problem Analyzing convergence of Langevin dynamics with time-dependent metrics.
method Formulated a modified gradient flow of the Kullback-Leibler divergence, selected a time-dependent relative Fisher information functional, and developed a time-dependent Hessian matrix condition.
result Proved convergence conditions for various Langevin dynamics.

New quantum algorithm simplifies complex financial derivatives pricing.

problem Complex financial derivatives pricing with high dimensionality.
method Quantum-inspired variational algorithms combined with neural-network quantum states.
result Simplified pricing of European options with many correlated assets.

Paper develops semi-analytic method for American options in time-dependent jump-diffusion models.

problem Pricing American options in models with time-dependent and exponential jumps.
method Generalizes existing methods for barrier and American options to handle arbitrary time dependencies and solves the problem through algebraic and Fredholm-Volterra equations.
result Presents a semi-analytic solution for American options in time-dependent jump-diffusion models with exponential jumps.

A new method uses deep learning to efficiently solve complex physics equations in high dimensions.

problem Efficiently solving high-dimensional time-dependent PDEs with dynamic solutions.
method Deep adaptive sampling framework for PINNs extended to spacetime domains using normalizing flows.
result The method effectively identifies and tracks high-residual regions in both space and time.

GrADE uses graph neural networks and Neural ODE for solving time-dependent nonlinear PDEs efficiently.

problem Solving time-dependent nonlinear PDEs is computationally challenging and time-consuming.
method GrADE combines graph neural networks for spatial modeling and Neural ODE for temporal modeling, using attention mechanisms.
result GrADE efficiently solves PDEs, demonstrating scalability and better accuracy compared to existing methods.

We analyze families of non-autonomous systems of first-order ordinary differential equations admitting a common time-dependent superposition rule, i.e., a time-dependent map expressing any solution of each of these systems in terms of a generic set of particular solutions of the system and some constants. We next study…

2010-03-18abs ↗pdf ↗

The paper develops methods to derive mixed superposition rules for Lie systems and applies them to various physical systems.

problem Finding general solutions for Lie systems.
method Develops mixed superposition rules for Lie systems with imprimitive Lie algebras and semidirect sums.
result Extends coalgebra method to Lie systems of partial differential equations.

MAntRA combines machine learning and Bayesian methods for time-dependent reliability analysis of unknown systems.

problem Time-dependent reliability analysis of systems with unknown governing physics.
method Combines machine learning, Bayesian statistics, and stochastic integration to discover and analyze SDEs from data.
result Demonstrates the effectiveness of MAntRA on three numerical examples, indicating its potential for in-situ and heritage structure analysis.

New method uses randomized sparse neural networks to solve time-dependent PDEs more accurately and efficiently.

problem Numerical challenges in training neural networks sequentially in time to solve time-dependent PDEs.
method Introduces Neural Galerkin schemes that update randomized sparse subsets of network parameters at each time step.
result Up to two orders of magnitude more accurate and two orders of magnitude faster than dense update schemes.

Dynamic Structural Causal Models handle time-dependent systems with cycles and latent confounding.

problem Representing and analyzing systems of Stochastic Differential Equations (SDEs) with DSCMs.
method Define time-splitting and subsampling operations to analyze DSCMs of SDEs, and apply existing causal discovery algorithms to time-series data.
result DSCMs provide a graphical Markov property for SDEs and enable identification of time-dependent causal effects.

A new RNN model tackles long-time dependencies with fast, invertible, and memory-efficient hidden states.

problem Challenges in processing sequential inputs with long-time dependencies in RNNs.
method A novel RNN architecture based on a Hamiltonian system of oscillators.
result The proposed RNN mitigates exploding and vanishing gradient problems, providing state-of-the-art performance.

Deep learning estimates time-varying Markov model parameters.

problem Estimating time-dependent parameters in Markov models.
method Reframes parameter estimation as an optimization problem using maximum likelihood.
result Real solution close to SDE with neural network-derived parameters under specific conditions.

LFIS uses a time-dependent velocity field to sample from complex distributions.

problem Sampling from unnormalized density functions.
method LFIS learns a time-dependent velocity field to transport samples from a simple initial distribution to a complex target distribution.
result LFIS achieves state-of-the-art performance on various benchmark problems.

A notion of implicit difference equation on a Lie groupoid is introduced and an algorithm for extracting the integrable part (backward or/and forward) is formulated. As an application, we prove that discrete Lagrangian dynamics on a Lie groupoid GG may be described in terms of Lagrangian implicit difference equations …

2010-11-16abs ↗pdf ↗

Paper shows how scattering maps of Schrödinger equations relate to metrics.

problem Relating scattering maps of time-dependent Schrödinger equations to metrics.
method Analyzes scattering maps for specific classes of metrics and diffeomorphisms.
result Scattering maps differ by a compact operator if and only if metrics are related by diffeomorphism.

In this paper we propose the time-dependent generalization of an `ordinary' autonomous human biomechanics, in which total mechanical + biochemical energy is not conserved. We introduce a general framework for time-dependent biomechanics in terms of jet manifolds associated to the extended musculo-skeletal configuration…

2009-07-12abs ↗pdf ↗

The usual formulations of time-dependent mechanics start from a given splitting Y=R×MY=R\times M of the coordinate bundle YRY\to R. From physical viewpoint, this splitting means that a reference frame has been chosen. Obviously, such a splitting is broken under reference frame transformations and time-dependent canonical …

1997-02-25abs ↗pdf ↗

Study methods to recover unknown processes in PDEs from data.

problem Identifying unknown processes in time-dependent PDEs using observational data.
method Theoretical analysis and numerical approaches including Galerkin and collocation algorithms.
result The Galerkin algorithm is more suitable for practical situations with noisy data.

Researchers find the optimal exercise time for American options using a specific type of diffusion process.

problem Finding the optimal time to exercise American options with a time-dependent Ornstein-Uhlenbeck process.
method Optimal stopping problem, probabilistic arguments, non-linear Volterra-type integral equation, Picard iteration algorithm.
result They derive a non-linear Volterra-type integral equation and prove the exercise boundary's Lipschitz continuity and differentiability almost everywhere.

Stochastic delay differential equations (SDDE's) have been used for financial modeling. In this article, we study a SDDE obtained by the equation of a CIR process, with an additional fixed delay term in drift; in particular, we prove that there exists a unique strong solution (positive and integrable) which we call fix…

2018-06-04abs ↗pdf ↗

If U:[0,+[×MU:[0,+\infty[\times M is a uniformly continuous viscosity solution of the evolution Hamilton-Jacobi equation tU+H(x,xU)=0,\partial_tU+ H(x,\partial_xU)=0, where MM is a not necessarily compact manifold, and HH is a Tonelli Hamiltonian, we prove the set Σ(U)Σ(U), of points where UU is not differentiable, is locally contrac…

2019-12-10abs ↗pdf ↗

A general, consistent and complete framework for geometrical formulation of mechanical systems is proposed, based on certain structures on affine bundles (affgebroids) that generalize Lie algebras and Lie algebroids. This scheme covers and unifies various geometrical approaches to mechanics in the Lagrangian and Hamilt…

2006-04-06abs ↗pdf ↗

LR-EDNN reduces PDE solver complexity by limiting network weights to low-rank subspace.

problem Efficiently solving time-dependent PDEs with deep neural networks.
method Low-rank constraint on network weights using SVD for efficient parameter updates.
result LR-EDNN achieves comparable accuracy to full EDNN with fewer parameters and lower cost.

A new method models continuous-time counterfactual outcomes using neural controlled differential equations.

problem Estimating personalized healthcare outcomes over irregularly sampled data.
method Interpreting data as samples from a continuous-time process, modeling latent trajectory using controlled differential equations, and using adversarial training for time-dependent confounding.
result TE-CDE consistently outperforms existing approaches in irregularly sampled scenarios.

A new kernel framework analyzes spatio-temporal data from dynamic equations.

problem Analyzing spatio-temporal data from dynamic equations with noisy measurements.
method Kernel-based framework with representer theorem for minimizing error with given samples.
result Minimizes error in solutions of dynamic equations with noisy spatio-temporal data.

Develops methods to learn correlation potentials for time-dependent Kohn-Sham systems.

problem Learning the correlation potential for time-dependent Kohn-Sham systems.
method Optimizing a least-squares objective subject to the TDKS equation using adjoints.
result Learned correlation potential models match ground truth electron densities and can have memory.

Let (M,g(t))(M, g(t)), t[0,T)t\in[0,T) be a closed Riemannian nn-manifold whose Riemannian metric g(t)g(t) evolves by the geometric flow tgij=2Sij \frac{\partial }{\partial t} g_{ij}=-2S_{ij} , where Sij(t)S_{ij}(t) is a symmetric two-tensor on (M,g(t))(M,g(t)). We discuss differential Harnack estimates for positive solution to the porous medium …

2019-01-30abs ↗pdf ↗

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.

We present three models of stock price with time-dependent interest rate, dividend yield, and volatility, respectively, that allow for explicit forms of the optimal exercise boundary of the finite maturity American put option. The optimal exercise boundary satisfies the nonlinear integral equation of Volterra type. We …

2019-12-11abs ↗pdf ↗

New method for pricing American options in time-dependent models, improving accuracy and efficiency.

problem Pricing American options in time-dependent models with improved accuracy and efficiency.
method Semi-analytical pricing using a nonlinear Volterra integral equation and numerical methods.
result Improved accuracy and efficiency in pricing American options compared to forward finite difference solvers.