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

Trend · papers per month

3571106141 · May 202619922001200920172026
48 results for Runge theorem

The abstract discusses families of holomorphic maps to Oka manifolds with approximation theorems.

problem Approximating \(J_b\)-holomorphic maps to Oka manifolds.
method Constructing continuous or smooth families of \(J_b\)-holomorphic maps to Oka manifolds with approximation on compact Runge sets.
result Runge and Mergelyan approximation theorems and Weierstrass interpolation theorem for families of open Riemann surfaces.

The paper develops theory for holomorphic null curves in SL2(C).

problem Developing theory for holomorphic null curves in SL2(C).
method Establish Runge, Mergelyan, Mittag-Leffler, and Carleman type theorems for holomorphic null immersions.
result Proves every open Riemann surface admits a proper holomorphic null embedding into SL2(C).

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.

The study quantifies the information needed for causal queries at different levels of Pearl's hierarchy.

problem How much additional information is needed for interventional and counterfactual queries compared to observational queries?
method Formalized via query-class description length, using Kolmogorov complexity of answer oracles induced by SCMs.
result Binary acyclic SCMs show a quadratic gap between observational and interventional descriptions, and a logarithmic gap between interventional and counterfactual descriptions.

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…

2014-06-10abs ↗pdf ↗

In 1996, Nadirashvili used Runge's theorem to produce a complete minimal disc inside a ball in R^3. In this paper we generalize the techniques used by Nadirashvili to obtain new examples of complete minimal surfaces inside a ball in R^3, with the conformal structure of an annulus.

2000-02-17abs ↗pdf ↗

Study magnetic perturbations in Riemannian and Lorentzian Calderón problems.

problem Determining metrics from boundary measurements under magnetic perturbations.
method Runge approximation for Riemannian case, microlocal analysis for Lorentzian case.
result Metrics can be uniquely determined in both Riemannian and Lorentzian cases under specific perturbations.

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 5/25/2-order L2L^2-accuracy in approximating Hamiltonian flows.

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.

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.

We examine spaces of connected tri-/univalent graphs subject to local relations which are motivated by the theory of Vassiliev invariants. It is shown that the behaviour of ladder-like subgraphs is strongly related to the parity of the number of rungs: there are similar relations for ladders of even and odd lengths, re…

2003-01-03abs ↗pdf ↗

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…

2019-10-16abs ↗pdf ↗

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…

2018-05-01abs ↗pdf ↗

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.

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-22 contraction, based on local deviat…

2019-06-19abs ↗pdf ↗

The study proves a transverse diameter theorem for Lorentzian foliations.

problem Understanding the geometry of foliations in Lorentzian spacetimes.
method Developed a novel causality structure on leaf spaces via transverse Lorentzian geometry.
result Derived a transverse diameter theorem for Lorentzian foliations and orbifolds.

We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of torus knots and links [3],[4], we prove that nontrivial embeddings of simple 3-…

2015-05-22abs ↗pdf ↗

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.

In this paper we study holomorphic immersions of open Riemann surfaces into C^n whose derivative lies in a conical algebraic subvariety A of C^n that is smooth away from the origin. Classical examples of such A-immersions include null curves in C^3 which are closely related to minimal surfaces in R^3, and null curves i…

2012-10-20abs ↗pdf ↗

New definition of patient-specific root causes of disease using counterfactuals.

problem Lack of rigorous mathematical formulation for automatic detection of root causes.
method Proposes a counterfactual definition matching clinical intuition and uses Shapley values for causal contribution scores.
result Adapts to disease prevalence, accounts for noisy labels, and admits fast computation.

Proves approximation and interpolation for regular immersions directed by algebraically elliptic cones.

problem Approximation and interpolation for regular immersions directed by algebraically elliptic cones.
method Uses homotopy-theoretic necessary and sufficient conditions for approximation and interpolation.
result Homotopy-theoretic conditions for approximation and interpolation are satisfied in many cases of interest.

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…

2011-07-14abs ↗pdf ↗

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.

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.

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.

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.

We study a moduli space of ASD connections over S3×RS^3\times \mathbb{R}. We consider not only finite energy ASD connections but also infinite energy ones. So the moduli space is infinite dimensional in general. We study the (local) mean dimension of this infinite dimensional moduli space. We show the upper bound on the …

2009-09-07abs ↗pdf ↗

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 …

2019-11-23abs ↗pdf ↗