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

Trend · papers per month

138276414552 · Jun 202019922001200920172026
48 results for Numerical Accuracy

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.

A new framework improves tensor completion accuracy by considering numerical priors.

problem Tensor completion accuracy loss due to ignoring numerical priors.
method Generalized CP Decomposition Tensor Completion (GCDTC) framework incorporating numerical priors.
result GCDTC framework outperforms state-of-the-arts in non-negative tensor completion.

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 aim of this work is to provide fast and accurate approximation schemes for the Monte-Carlo pricing of derivatives in the Lévy LIBOR model of Eberlein and Özkan (2005). Standard methods can be applied to solve the stochastic differential equations of the successive LIBOR rates but the methods are generally slow. We …

2010-06-16abs ↗pdf ↗

Diffusion models' speed-accuracy relations derived from thermodynamics.

problem Understanding the trade-off between model speed and accuracy.
method Connecting diffusion models to thermodynamics and optimal transport.
result Speed-accuracy relations derived, providing insights into optimal learning protocols.

Paper proposes a method to speed up DNNs by quantizing Winograd/Toom-Cook convolutions.

problem Speeding up convolution computations in DNNs with reduced time consumption and improved accuracy.
method Application of base change technique for quantized Winograd-aware training model.
result 8-bit quantized network achieves nearly the same accuracy as direct quantized convolution with minimal additional operations.

Single tree outperforms random forest in testing accuracy.

problem The challenge of improving single decision tree performance.
method Gradient-based entire tree optimization framework, scaled sigmoid approximation, numerical stability algorithm, subtree polish strategy.
result Optimized single tree outperforms classic random forest by 2.03% on average.

We perform a massive evaluation of neural networks with architectures corresponding to random graphs of various types. We investigate various structural and numerical properties of the graphs in relation to neural network test accuracy. We find that none of the classical numerical graph invariants by itself allows to s…

2020-02-19abs ↗pdf ↗

With ever-increasing computational demand for deep learning, it is critical to investigate the implications of the numeric representation and precision of DNN model weights and activations on computational efficiency. In this work, we explore unconventional narrow-precision floating-point representations as it relates …

2018-08-07abs ↗pdf ↗

HRTPP improves TPP interpretability and accuracy in medical event modeling.

problem Lack of interpretability in TPPs for medical event sequences.
method Hybrid-Rule Temporal Point Processes (HRTPP) integrating temporal logic rules and numerical features.
result HRTPP outperforms state-of-the-art interpretable TPPs in predictive performance and clinical interpretability.

This paper deals with the numerical approximation of American-style option values governed by partial differential complementarity problems. For a variety of one- and two-asset American options we investigate by ample numerical experiments the temporal convergence behaviour of three modern splitting methods: the explic…

2016-10-30abs ↗pdf ↗

New ladder methods improve numerical accuracy in parallel transport on manifolds.

problem Lack of convergence analysis for ladder schemes on manifolds.
method Taylor approximations and iterative constructions of geodesic parallelograms.
result Ladder methods converge quadratically with quadratic speed.

New findings show score matching's accuracy doesn't ensure numerical stability in diffusion sampling.

problem Numerical stability issues in diffusion sampling despite small forward-marginal error.
method Constructing a smooth score field with arbitrarily small forward-marginal L2L^2 error, showing nonexplosive behavior and moments of every order.
result Euler--Maruyama discretizations can converge in probability even when moments diverge, demonstrating failure of weak convergence.

A new method computes Greeks for multi-asset options using tensor trains and Fourier transforms.

problem Efficient computation of Greeks for multi-asset options with high accuracy and low sample complexity.
method Tensor train (TT) representations of Fourier-based pricing functions, combined with numerical differentiation or analytical approaches.
result Significant speed-ups of up to 105imes10^{5} imes over Monte Carlo simulations while maintaining comparable accuracy.

Lightweight architectural designs of Convolutional Neural Networks (CNNs) together with quantization have paved the way for the deployment of demanding computer vision applications on mobile devices. Parallel to this, alternative formulations to the convolution operation such as FFT, Strassen and Winograd, have been ad…

2020-02-25abs ↗pdf ↗

Hybrid method improves accuracy and speed of breast model parameter estimation.

problem Accurate estimation of breast mechanical parameters for surgical simulations.
method Combines deep learning (MNN) with iterative solvers to ensure accuracy and speed.
result Hybrid method achieves both real-time performance and reliability.

We propose and analyze numerical methods for the Heath-Jarrow-Morton (HJM) model. To construct the methods, we first discretize the infinite dimensional HJM equation in maturity time variable using quadrature rules for approximating the arbitrage-free drift. This results in a finite dimensional system of stochastic dif…

2011-09-12abs ↗pdf ↗

Improved numerical solution for BSDEs with reduced boundary errors.

problem Boundary errors in numerical solution of BSDEs.
method Modified damping and shifting schemes to transform target function into a bounded periodic function, applying Fourier transforms.
result Significant reduction in boundary errors with improved accuracy and convergence.

SONet stabilizes ODE networks for robustness without adversarial training.

problem Improving adversarial robustness of neural networks without sacrificing natural accuracy.
method SONet uses skew-symmetric ODE blocks and DOPRI5 solver for robustness.
result SONet achieves comparable robustness to adversarial defense methods without trade-off.

New method for long-term sampling of complex dynamics on curved spaces.

problem Sampling ergodic dynamics on Riemannian manifolds efficiently over long periods.
method Intrinsic geometric operations for sampling invariant measure without embeddings.
result Outperforms previous methods in long-term sampling efficiency.

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.

Method improves simulation accuracy by mitigating distribution shift in hybrid systems.

problem Mitigating distribution shift in machine-learning augmented hybrid simulation.
method Tangent-space regularized estimator to control distribution shift.
result Marked improvements in simulation accuracy, especially for systems with high distribution shift.

Analytical pricing formulas and Greeks are obtained for European and American basket put options using Mellin transforms. We assume assets are driven by geometric Brownian motion which exhibit correlation and pay a continuous dividend rate. A novel approach to numerical Mellin inversion is achieved via the fast Fourier…

2014-03-15abs ↗pdf ↗

Two-layer networks struggle with high frequencies due to numerical and computational limitations.

problem High frequency approximation and learning in shallow networks.
method Mathematical and computational analysis focusing on numerical error, computational cost, and stability.
result Explicit answers to fundamental computational issues in shallow networks' high frequency handling.

Study shows how numerical discretization affects reconstructions and parameter distributions in nano metrology.

problem Impact of numerical discretization on parameter reconstructions and model parameter distributions.
method Bayesian target vector optimization, finite element model, Gaussian process, stochastic machine learning surrogate models, Markov chain Monte Carlo sampler.
result Numerical discretization parameters impact the accuracy and distribution of reconstructed model parameters.

Vecchia approximations provide the best accuracy-runtime trade-off for Gaussian process approximations.

problem High computational cost of Gaussian processes for large data sets.
method Systematic comparison of different Gaussian process approximations.
result Vecchia approximations consistently provide the best accuracy-runtime trade-off.

We present effective numerical algorithms for locally recovering unknown governing differential equations from measurement data. We employ a set of standard basis functions, e.g., polynomials, to approximate the governing equation with high accuracy. Upon recasting the problem into a function approximation problem, we …

2018-09-24abs ↗pdf ↗