Runge-Kutta methods are the classic family of solvers for ordinary differential equations (ODEs), and the basis for the state of the art. Like most numerical methods, they return point estimates. We construct a family of probabilistic numerical methods that instead return a Gauss-Markov process defining a probability d…
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,657 papers · 148 categories
Trend · papers per month
48 results for “Runge-Kutta methods”
New probabilistic scheme combines deep learning with Runge-Kutta methods for solving PDEs.
problem Solving high-dimensional semi-linear parabolic PDEs efficiently.
method Probabilistic scheme using deep learning and Runge-Kutta methods.
result Crank-Nicolson schemes are efficient in terms of precision, computational cost, and numerical implementation.
The Runge-Kutta-Legendre scheme improves pricing American options and other derivatives.
problem Pricing American options and other derivatives with improved accuracy and stability.
method Runge-Kutta-Legendre finite difference scheme applied to Black-Scholes and Heston models.
result Improved convergence and stability compared to existing schemes.
Randomized Runge-Kutta-Nyström Methods for Unadjusted Hamiltonian and Kinetic Langevin Monte Carlomath.NA
New methods improve efficiency of sampling algorithms for complex systems.
problem Efficiently sampling from complex, high-dimensional probability distributions.
method Randomized Runge-Kutta-Nyström methods tailored for Hamiltonian flows.
result Quantitative -order -accuracy in approximating Hamiltonian flows.
Note on instabilities in super-time-stepping methods for Heston model.
problem Instabilities in super-time-stepping methods applied to Heston model.
method Exploration of explicit super-time-stepping schemes (RK-Chebyshev, RK-Legendre) for Heston model.
result Relevance of stability remarks beyond super-time-stepping schemes.
Rex solves the inverse problem for ODE/SDE solvers, improving precision and stability.
problem Inversion of ODE/SDE solvers is inaccurate and impractical for precision applications.
method Rex uses Lawson methods to convert explicit Runge-Kutta schemes into algebraically reversible ones.
result Rex achieves near-machine-precision reconstruction and improves generative models.
A new method solves American put options with high accuracy and speed.
problem Solving American put options with high accuracy and speed.
method Adaptive fourth-order Runge-Kutta-Fehlberg method coupled with a fourth-order compact scheme.
result The method provides a more accurate solution and better performance in terms of computational speed.
Meta-learning has emerged as an important framework for learning new tasks from just a few examples. The success of any meta-learning model depends on (i) its fast adaptation to new tasks, as well as (ii) having a shared representation across similar tasks. Here we extend the model-agnostic meta-learning (MAML) framewo…
New method speeds up SDE inference by matching moments to FPK equation.
problem Efficiency of sampling schemes in high-dimensional SDEs.
method Direct approximation of Fokker-Planck-Kolmogorov equation by matching moments.
result Fast, scalable inference in high-dimensional latent spaces.
Paper proposes a new method to speed up diffusion models.
problem High computational cost of sampling from diffusion models.
method Stochastic Runge-Kutta method for acceleration.
result Provable acceleration with reduced score function evaluations.
We study gradient-based optimization methods obtained by directly discretizing a second-order ordinary differential equation (ODE) related to the continuous limit of Nesterov's accelerated gradient method. When the function is smooth enough, we show that acceleration can be achieved by a stable discretization of this O…
New boundary treatment improves accuracy for complex PDEs.
problem Order reduction in high-order IMEX schemes for multidimensional PDEs.
method Novel boundary treatment algorithms for Cartesian meshes, treating implicit-explicit stages similarly to interior points.
result Recovery of designed order of convergence by numerical verification.
Sampling with Markov chain Monte Carlo methods often amounts to discretizing some continuous-time dynamics with numerical integration. In this paper, we establish the convergence rate of sampling algorithms obtained by discretizing smooth Itô diffusions exhibiting fast Wasserstein- contraction, based on local deviat…
The minimization of the loss function is of paramount importance in deep neural networks. On the other hand, many popular optimization algorithms have been shown to correspond to some evolution equation of gradient flow type. Inspired by the numerical schemes used for general evolution equations we introduce a second o…
Higher-order ODE solvers improve deep learning performance.
problem Improving deep learning performance using higher-order ODE solvers.
method Evaluation and improvement of Runge-Kutta (RK) methods for deep learning.
result Higher-order RK solvers can improve deep learning performance by incorporating key ingredients of optimizers.
A novel symplectic integrator for Hamiltonian equations on $S_2^n \times T^{\ast} \RR^m$ is developed and studied. Partitioned Runge--Kutta methods for Hamiltonian systems on products of Hamiltionian manifolds are studied, specifically, algebraic conditions for their symplecticity are derived.
A higher-order Runge-Kutta optimizer performs poorly compared to Adam when evaluated fairly.
problem Evaluating the performance of adaptive Runge-Kutta optimizers under strict conditions.
method Built and evaluated a representative Adam variant using a Bogacki-Shampine 3(2) RK pair, FSAL reuse, and local-error step control.
result The adaptive nature of the RK optimizer is illusory; it behaves like a fixed-step optimizer with gradient averaging.
New deep learning architecture learns martingales efficiently.
problem Efficiently learning martingales in financial derivatives pricing.
method High-order weak approximation algorithms of Runge-Kutta type.
result Deep neural networks based on this architecture learn martingales effectively.
Geometric methods integrate Lie systems for optimal control problems.
problem Integrating Lie systems for optimal control problems.
method Geometric numerical methods based on Magnus expansions and Runge-Kutta-Munthe-Kaas.
result Accurate numerical solutions for Lie systems in optimal control problems.
We derive the explicit formula for the joint Laplace transform of the Wishart process and its time integral which extends the original approach of Bru. We compare our methodology with the alternative results given by the variation of constants method, the linearization of the Matrix Riccati ODE's and the Runge-Kutta al…
Novel IMEX scheme solves financial PDEs with mixed derivatives.
problem Numerical approximations for financial PDEs with mixed derivatives.
method Second order finite volume IMEX Runge-Kutta scheme.
result Achieves true second order convergence with non-regular initial conditions.
Invariant connections, Lie algebra actions, and foundations of numerical integration on manifoldsmath.DG
Motivated by numerical integration on manifolds, we relate the algebraic properties of invariant connections to their geometric properties. Using this perspective, we generalize some classical results of Cartan and Nomizu to invariant connections on algebroids. This has fundamental consequences for the theory of numeri…
The paper models star dynamics using Ricci flow and Perelman entropy, revealing chaotic behavior.
problem Modeling chaotic positional dynamics of stars in celestial systems.
method Discrete dynamical systems, Ricci flow, Perelman entropy, Lyapunov exponents, bifurcation analysis.
result Entropy increases exponentially, indicating challenging long-term star position prediction.
The paper studies dynamical systems with evolving geometric structure using numerical methods.
problem Qualitative behavior of ODEs with varying geometric structure.
method Fourth-order Runge-Kutta scheme for numerical analysis.
result Qualitative transitions in system dynamics as rotation parameter varies.
This paper proposes a new method to learn integration schemes for complex ODEs.
problem Learning efficient integration schemes for non-linear ODEs and their identification.
method A novel framework to learn integration schemes that minimize an integration-related cost function.
result The proposed learning-based approach provides integration schemes close to analytical solutions.
Explicit RKF-Compact Scheme for Pricing Regime Switching American Options with Varying Time Stepq-fin.CP
New method solves complex financial option pricing with varying time steps.
problem Pricing American options with varying time steps and regime switching.
method Explicit Runge-Kutta-Fehlberg scheme with fourth-order compact finite difference in space and high order analytical approximation.
result The method provides better performance in terms of computational speed and accuracy.
New method calculates geodesic distances in Gaussian random field manifolds.
problem Quantifying similarity between random fields in different regimes.
method Numerical method using geodesic distances in Gaussian random field manifolds.
result Estimation of geodesic distances for various initial conditions.
Neural dynamical systems are dynamical systems that are described at least in part by neural networks. The class of continuous-time neural dynamical systems must, however, be numerically integrated for simulation and learning. Here, we present a compact neural circuit for two common numerical integrators: the explicit …
ContinuousNet generalizes ResNets to continuous dynamical systems.
problem ResNets fail to be meaningful dynamical integrators.
method Embedding continuous dynamical systems into higher-order numerical integration schemes (Runge Kutta).
result ContinuousNet exhibits invariance to discrete time step sizes and numerical integration schemes.
The Willmore flow is well known problem from the differential geometry. It minimizes the Willmore functional defined as integral of the mean-curvature square over given manifold. For the graph formulation, we derive modification of the Willmore flow with anisotropic mean curvature. We define the weak solution and we pr…
Calibrated probabilistic solvers improve accuracy of ODE estimates.
problem Uncertainty in probabilistic ODE solutions is not well-calibrated for adaptive step sizes.
method Introduce and assess several calibration methods for probabilistic ODE solvers.
result Calibration methods interact efficiently with adaptive step-size selection, improving posteriors.
There is resurging interest, in statistics and machine learning, in solvers for ordinary differential equations (ODEs) that return probability measures instead of point estimates. Recently, Conrad et al. introduced a sampling-based class of methods that are 'well-calibrated' in a specific sense. But the computational c…
New method stabilizes GAN training by solving ODEs.
problem Stability issues in GAN training.
method Solving ordinary differential equations (ODEs) to stabilize GAN training.
result Well-known ODE solvers can stabilize GAN training.
Like many numerical methods, solvers for initial value problems (IVPs) on ordinary differential equations estimate an analytically intractable quantity, using the results of tractable computations as inputs. This structure is closely connected to the notion of inference on latent variables in statistics. We describe a …
The correspondence between residual networks and dynamical systems motivates researchers to unravel the physics of ResNets with well-developed tools in numeral methods of ODE systems. The Runge-Kutta-Fehlberg method is an adaptive time stepping that renders a good trade-off between the stability and efficiency. Can we …
We present a derivation and theoretical investigation of the Adams-Bashforth and Adams-Moulton family of linear multistep methods for solving ordinary differential equations, starting from a Gaussian process (GP) framework. In the limit, this formulation coincides with the classical deterministic methods, which have be…
High-order integrators for Lagrangian systems on homogeneous spaces via nonholonomic mechanicsmath.NA
New integrators for Lagrangian systems on homogeneous spaces derived from nonholonomic mechanics.
problem Numerical integration of Lagrangian systems on homogeneous spaces.
method Nonholonomic partitioned Runge-Kutta Munthe-Kaas (RKMK) methods on Lie groups.
result Preservation of properties in high-order numerical integrators.
To understand the fundamental trade-offs between training stability, temporal dynamics and architectural complexity of recurrent neural networks~(RNNs), we directly analyze RNN architectures using numerical methods of ordinary differential equations~(ODEs). We define a general family of RNNs--the ODERNNs--by relating t…
Continuous-time PCD for MLE with explicit error bounds.
problem Maximum likelihood estimation of unnormalised densities.
method Continuous-time formulation as coupled SDEs, deriving UiT bounds.
result Explicit error bounds between PCD iterates and MLE solution.
Novel method combines physics priors for energy-conserving dynamics.
problem Learning long-term dynamics of complex physical systems from noisy data.
method Variational Integrator Graph Networks integrating energy constraint, high-order symplectic integrators, and graph neural networks.
result Improves predictive performance across single and many-body problems.
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.
The forecasting and reconstruction of ocean and atmosphere dynamics from satellite observation time series are key challenges. While model-driven representations remain the classic approaches, data-driven representations become more and more appealing to benefit from available large-scale observation and simulation dat…
Investigation of the Estimation Accuracy of 5 Different Numerical ODE Solvers on 3 Case Studiesmath.NA
Study compares 5 ODE solvers on 3 case studies, finding varying accuracy.
problem Comparing estimation accuracy of 5 ODE solvers on 3 case studies.
method Used 5 different numerical ODE solvers (Euler's, Heun's, Midpoint, Runge-Kutta 4th order, ODE45) on 3 case studies and compared their results.
result Different solvers have varying accuracy depending on the case study.
Improved fourth-order compact scheme for option valuation with Robin boundary condition.
problem Lower convergence rates in numerical methods for American options.
method High-order compact scheme, Robin boundary condition, coupled nonlinear PDEs.
result Fourth-order convergence rate achieved without mesh refinement.
New samplers reduce NFEs for diffusion models.
problem High NFEs in diffusion models.
method Quasi-Taylor samplers based on ideal derivatives.
result Reduced NFEs for image synthesis.
The paper refines optimization algorithms using Lyapunov functions and differential equations.
problem Improving convergence rates of optimization algorithms.
method Revisiting Fazylab's framework, relaxing conditions, and introducing new differential equations.
result Improved convergence rates for optimization algorithms, including Nesterov and Polyak algorithms.
Neural networks enjoy widespread use, but many aspects of their training, representation, and operation are poorly understood. In particular, our view into the training process is limited, with a single scalar loss being the most common viewport into this high-dimensional, dynamic process. We propose a new window into …
Soft-constrained PINN solves ODEs with minimal data, improving efficiency and robustness.
problem Sparse and noisy data in experiments and simulations.
method Soft-constrained Physics-informed Neural Network (PINN) with minimal labeled data.
result Soft-constrained PINN reduces need for labeled data and achieves strong generalization.