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

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920182026
48 results for numerical integration error

Paper evaluates squared-exponential covariance function for Gaussian processes with integral observations.

problem Evaluating double line integrals of the squared exponential covariance function in Gaussian processes.
method Proposes a new approach to reduce double integrals to a single integral using the error function and efficiently computed with numerical techniques.
result Shows superior numerical robustness and accuracy compared to existing methods.

The paper integrates Gaussian processes into numerical integration schemes to improve accuracy and uncertainty quantification.

problem Improving the accuracy and uncertainty quantification in numerical integration schemes.
method Embedding Gaussian process regression into numerical integration schemes (Bulirsch-Stoer algorithm).
result Gaussian process regression can provide robust solutions even in scenarios where traditional polynomial extrapolation fails.

Integration of the form af(x)w(x)dx\int_a^\infty {f(x)w(x)dx} , where w(x)w(x) is either sin(ωx)\sin (ω{\kern 1pt} x) or cos(ωx)\cos (ω{\kern 1pt} x), is widely encountered in many engineering and scientific applications, such as those involving Fourier or Laplace transforms. Often such integrals are approximated by a numerical integration…

2010-05-11abs ↗pdf ↗

A research frontier has emerged in scientific computation, wherein numerical error is regarded as a source of epistemic uncertainty that can be modelled. This raises several statistical challenges, including the design of statistical methods that enable the coherent propagation of probabilities through a (possibly dete…

2015-12-03abs ↗pdf ↗

Corrects local error estimates for UBU integrator in SDEs, improving complexity guarantees.

problem Improper local error estimates in UBU integrator for SDEs.
method Reconciles theory with practice by correcting local error estimates.
result Stronger assumptions needed for O(d1/4ε1/2)\mathcal{O}(d^{1/4}ε^{-1/2}) steps in Wasserstein-2 distance.

Study investigates how errors in reinsurance parameters degrade optimal solutions.

problem Effectiveness of optimal reinsurance solutions degraded by errors in parameters and models.
method Asymptotic and numerical studies, including Value at Risk criteria and Bayesian integration.
result Rate of degradation often O(1/n)O(1/n), but can be O(1/n)O(1/\sqrt{n}) for Value at Risk.

Computation of moments of transformed random variables is a problem appearing in many engineering applications. The current methods for moment transformation are mostly based on the classical quadrature rules which cannot account for the approximation errors. Our aim is to design a method for moment transformation for …

2017-01-05abs ↗pdf ↗

Paper proposes a method to numerically approximate differential privacy guarantees using FFT.

problem Computing tight differential privacy guarantees for machine learning algorithms.
method The method uses numerical approximation of an integral formula, discretization, and the fast Fourier transform algorithm.
result Significant improvements in bound tightness and computation time compared to state-of-the-art techniques.

Derives equations for systems with external forces using variational methods.

problem Deriving equations for systems subjected to external forces.
method Variational derivation of Euler-Poincaré equations using Poisson groupoid geometry.
result Derives variational error for numerical integrators of forced systems.

Efficiently approximates integrals using a subset of samples from a target distribution in RKHS.

problem Approximating integrals with a target distribution using limited pointwise evaluations.
method Proposes a procedure using a small random subset of samples from the target distribution, either uniformly or using approximate leverage scores.
result Upper bound on approximation error for both sampling strategies, achieving optimal rate with reduced evaluations.

Study on error rates for approximating rough volatility models.

problem Simulation of rough volatility models with fractional Brownian motion.
method Analysis of weak error rates for numerical schemes, focusing on fBm and cubic test functions.
result Convergence rates for approximations are (3H+12)1(3H+ \frac{1}{2}) \wedge 1 for exact left-point discretization and H+12H+\frac{1}{2} for hybrid schemes.

Consider a process, stochastic or deterministic, obtained by using a numerical integration scheme, or from Monte-Carlo methods involving an approximation to an integral, or a Newton-Raphson iteration to approximate the root of an equation. We will assume that we can sample from the distribution of the process from time…

2010-05-12abs ↗pdf ↗

Novel Hilbert space Gaussian process improves sequential design accuracy and efficiency.

problem Efficiently implementing Gaussian process acquisition functions for expensive simulations.
method Proposed a truncated eigenbasis representation for closed-form evaluation of IMSE acquisition function.
result Significantly lower prediction error and reduced computation time compared to benchmarks.

L-HNNs improve Bayesian inference efficiency by reducing gradient computation.

problem Efficient Bayesian inference with minimal gradient computation.
method Integrating L-HNNs into NUTS with online error monitoring.
result L-HNNs in NUTS outperform NUTS in complex posterior densities.

Paper proposes efficient method to calculate Fisher-Bingham distribution normalizing constant.

problem Efficiently calculating the normalizing constant of Fisher-Bingham distributions.
method Numerical integration with continuous Euler transform to Fourier-type integral representation.
result The method is fast and accurate, applicable to high-dimensional distributions.

FBSJNN solves PIDEs and FBSDEJs with deep learning, offering theoretical and numerical efficiency.

problem Solving Partial Integro-Differential Equations and Forward-Backward Stochastic Differential Equations with Jumps.
method FBSJNN framework using a single neural network for both solution approximation and non-local integral.
result FBSJNN achieves numerical solutions with a relative error of 10310^{-3}, demonstrating efficiency.

L-HNNs improve Bayesian inference by reducing gradient requirements and improving ESS.

problem Efficient Bayesian inference with complex target densities.
method Latent Hamiltonian Neural Networks (L-HNNs) with NUTS, incorporating online error monitoring.
result L-HNNs in NUTS with online error monitoring required 1--2 orders of magnitude fewer numerical gradients and improved ESS by an order of magnitude.

The standard Kernel Quadrature method for numerical integration with random point sets (also called Bayesian Monte Carlo) is known to converge in root mean square error at a rate determined by the ratio s/ds/d, where ss and dd encode the smoothness and dimension of the integrand. However, an empirical investigation re…

2017-06-11abs ↗pdf ↗

This paper analyzes AJIVE for estimating shared subspace across multiple datasets, revealing its strengths and limitations.

problem Estimating shared subspace across multiple datasets with varying degrees of misalignment.
method Angle-based Joint and Individual Variation Explained (AJIVE) method, a two-stage spectral approach.
result AJIVE's performance in high signal-to-noise ratio (SNR) regimes and its non-diminishing error in low-SNR settings.

New algorithm speeds up MCMC for complex distributions.

problem Efficient sampling from complex, high-dimensional distributions.
method Numerical Generalized Randomized Hamiltonian Monte Carlo with state-dependent event rates.
result Approximates Hamiltonian trajectories for robust sampling.

CNN improves medium-range temperature forecasts with limited resources.

problem Limited computational resources for high-resolution temperature forecasts.
method CNN post-processing with ensemble NWP models for bias correction and spatial downscaling.
result High-resolution (5-km) surface temperature forecasts with lead times up to 5.5 days.

Combines experimental and historical data for robust policy evaluation.

problem Policy evaluation with mixed data sources, especially experimental vs historical.
method Linear integration of estimators from experimental and historical data, optimized for MSE minimization.
result Proposed estimators outperform traditional methods in ridesharing company data.

MEDIDA discovers model errors in chaotic systems using sparse regression and data assimilation.

problem Model errors in chaotic systems lead to significant discrepancies between model predictions and real-world states.
method MEDIDA combines Bayesian sparse regression and data assimilation to estimate and interpret model errors from noisy observations.
result MEDIDA successfully identifies different types of model errors in the chaotic Kuramoto-Sivashinsky system.

Unified kernel framework extends to stochastic systems, improving numerical stability.

problem Extending kernel methods to stochastic dynamical systems with diffusion.
method Unified kernel framework, Feynman-Kac path-integral representations, collocation-based computational framework.
result Kernel equivalence under uniform ellipticity assumptions and improved numerical stability with moderate diffusion.

Develops AMITE for analyzing neural network nonlinearities.

problem Addressing difficulties in verification, explainability, and security in neural network analysis.
method Analytically modified integral transform expansion (AMITE) for neural network nonlinearities.
result First to provide six mutually exclusive desired expansion properties.

We introduce the Variational Holder (VH) bound as an alternative to Variational Bayes (VB) for approximate Bayesian inference. Unlike VB which typically involves maximization of a non-convex lower bound with respect to the variational parameters, the VH bound involves minimization of a convex upper bound to the intract…

2015-06-19abs ↗pdf ↗

The paper improves probabilistic herding methods using Gibbs distributions.

problem Improving integration accuracy over Monte Carlo quadrature in infinite-dimensional RKHS.
method Developed a Gibbs distribution over quadrature nodes to minimize MMD.
result The Gibbs distribution outperforms i.i.d. Monte Carlo in integration accuracy.