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

Trend · papers per month

4080119159 · Jun 202019922001200920182026
48 results for quadrature integration

This paper improves filtering of non-linear systems with heavy-tailed noise.

problem Improving filtering accuracy for non-linear systems with heavy-tailed noise.
method Developed a moment transformation for Student-t distributed random variables using Student-t process quadrature.
result The method outperforms state-of-the-art moment transforms in numerical examples.

Bayesian Quadrature speeds up integration by selecting batches of points instead of single points.

problem Efficiently parallelizing Bayesian Quadrature for integration over non-negative integrands.
method Developed methods to select batches of points at each step, based on recent batch Bayesian Optimization.
result Significantly reduces computation time, especially for expensive integrands.

Kernel Quadrature improves numerical integration with adaptive tempering.

problem Optimizing sampling distribution for Kernel Quadrature to reduce integration error.
method Adaptive tempering and sequential Monte Carlo approach to find optimal sampling distribution.
result Significant reduction in integration error (up to 4 orders of magnitude) achieved with the proposed method.

New analysis proves consistency for adaptive Bayesian quadrature methods.

problem No theoretical guarantees for adaptive Bayesian quadrature methods.
method Introduces weak adaptivity and proves consistency for a broad class of adaptive Bayesian quadrature rules.
result Proves consistency and derives non-tight but informative convergence rates for adaptive Bayesian quadrature methods.

New quadrature method using randomly pivoted Cholesky outperforms existing techniques.

problem Efficiently approximating integrals of functions in reproducing kernel Hilbert spaces.
method Nodes drawn by randomly pivoted Cholesky algorithm.
result Randomly pivoted Cholesky quadrature is fast and achieves comparable accuracy to more computationally intensive methods.

Unified quadrature framework for large-scale kernel machines.

problem Efficiently approximating kernel functions for large-scale machine learning.
method Deterministic and randomized interpolatory rules for numerical integration of kernel functions.
result The proposed method reduces the number of nodes needed for accurate kernel approximation.

The study develops a quadrature method for the generalized hyperbolic distribution using finite normal-mixture approximation.

problem Efficiently approximating and computing expectations under the generalized hyperbolic distribution.
method Derived a numerical quadrature from Gauss-Hermite quadrature, approximated the distribution as a finite normal variance-mean mixture.
result Accurately computed expectations and sampled generalized hyperbolic random variates using the proposed method.

Herding and kernel herding are deterministic methods of choosing samples which summarise a probability distribution. A related task is choosing samples for estimating integrals using Bayesian quadrature. We show that the criterion minimised when selecting samples in kernel herding is equivalent to the posterior varianc…

2014-08-09abs ↗pdf ↗

Herding and kernel herding are deterministic methods of choosing samples which summarise a probability distribution. A related task is choosing samples for estimating integrals using Bayesian quadrature. We show that the criterion minimised when selecting samples in kernel herding is equivalent to the posterior varianc…

2012-04-07abs ↗pdf ↗

This paper introduces repulsive Monte Carlo methods for computing the sliced Wasserstein distance.

problem Computing the integral of a function on the unit sphere using Monte Carlo methods.
method The approach involves using determinantal point processes and repelled point processes to create quadratures for the sliced Wasserstein distance.
result The UnifOrtho estimator is recommended for the computation of the sliced Wasserstein distance in large dimensions.

Combines control variates and adaptive importance sampling for Monte Carlo integration.

problem Improving Monte Carlo integration accuracy with control variates and adaptive sampling.
method A quadrature rule combining control variates and adaptive importance sampling.
result Non-asymptotic bound on the probabilistic error of the procedure.

Adaptive quadrature improves Bayesian inference through active learning.

problem Efficiently estimating posterior densities in Bayesian inference.
method Sequential node selection using acquisition functions, combining interpolative surrogate models and quadrature rules.
result Positive estimation of marginal likelihood with improved accuracy.

Improved kernel herding algorithm for faster quadrature rule convergence.

problem Slow convergence speed of standard kernel herding algorithm.
method Improved gradient approximation to obtain sparser solutions.
result The cosine of the angle between negative gradient and approximate gradient determines convergence speed.

Study improves kernel quadrature for infinitely wide models with faster approximation and estimation rates.

problem Efficiently approximating and estimating expectations in infinitely wide models.
method Developed general kernel quadrature (GKQ) for parameter distributions, achieving faster rates.
result Achieved a fast approximation rate of O(ep)O(e^{-p}) and a fast estimation rate of O~(1/n)\widetilde{O}(1/n).

Improved option pricing for SABR model using Gauss-Hermite quadrature.

problem Improving accuracy of option pricing in the SABR model.
method Using Gauss-Hermite quadrature for numerical integration of the integrated variance.
result New method provides accurate option prices across all strike prices.

Study of Hamilton-Jacobi Theory with symmetries and integrability by quadratures.

problem Hamilton-Jacobi equation in systems with symmetries.
method Constructing complete solutions and solving reconstruction equations.
result Explicit expressions for exponential curves in Lie groups, valid for all elements in the Lie algebra.

Unified method for efficient pricing of multivariate options.

problem Efficient pricing of complex financial options under multivariate models.
method Unified method using quadrature integration of multi-asset BSM prices, state space rotation.
result Unified method provides accurate and efficient pricing for basket, spread, and Asian options.

Bayesian quadrature improves numerical efficiency and uncertainty representation.

problem Computing integrals of multiple related functions efficiently and accurately.
method Extending Bayesian quadrature to handle multiple related functions, proving convergence rates.
result The method provides increased numerical efficiency and more faithful uncertainty representation.

This work introduces a fixed-point optimization for variational inference.

problem Improving quantified uncertainty in predictions by optimizing a simplified distribution over parameters.
method Projective integral updates for high-dimensional variational inference.
result Efficient quasirandom quadrature sequence for mean-field distributions, leading to quasi-Newton variational Bayes (QNVB).

Develops numerical method for joint probability estimation from random processes.

problem Estimating joint probability distribution from random processes.
method Formulates and solves generalized eigenvalue problems for two random processes, then uses projections of eigenvectors to build a joint distribution estimator.
result Develops a new type of probability correlation, Pf[i];g[j]P_{f^{[i]};g^{[j]}}, for random processes.

Study geodesic curves on Heisenberg group, classify them, and compute first step of quadrature.

problem Classifying geodesic curves on the Heisenberg group.
method Completely integrable Hamiltonian system, classification of geodesic curves.
result Complete classification of geodesic curves on the Heisenberg group.

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.

Active multi-source Bayesian quadrature improves efficiency in expensive function evaluations.

problem Efficiently solving integrals of expensive-to-evaluate functions using multiple related sources of information.
method Constructing cost-sensitive multi-source acquisition rates as an extension to vanilla Bayesian quadrature.
result Active multi-source Bayesian quadrature allocates budget more efficiently than vanilla Bayesian quadrature.

New Fourier features improve high-precision approximation in large-scale problems.

problem Designing scalable, high-precision Fourier features for large-scale kernel methods.
method Introducing a new family of quadrature rules that accurately approximate the Gaussian measure in higher dimensions.
result Improved approximation bounds with new Fourier features.

New theory extends Hamilton-Jacobi for contact systems, ensuring integrability.

problem Integrability of contact Hamiltonian systems.
method Developed a Hamilton-Jacobi theory for fibered phase spaces, applied to contact systems, studied HJE solutions.
result Complete pseudo-isotropic solutions ensure integrability by quadratures for contact systems.

Kernel quadrature improves CRPS estimation for probabilistic time-series forecasting.

problem Intractable integrations in CRPS evaluation metrics lead to improper rankings of forecasting models.
method Introduced kernel quadrature approach for unbiased CRPS estimation and scalable computation.
result Our approach consistently outperforms existing CRPS estimators.

The paper improves error bounds for Bayesian quadrature in noisy settings.

problem Improving error bounds for Bayesian quadrature in noisy settings.
method Develops a two-step meta-algorithm to relate average-case quadrature error to L2L^2-function approximation error.
result Provides new average-case results for various kernels and noise settings.

A new method optimizes Fourier pricing for multi-asset options using adaptive quadrature.

problem Efficiently pricing multi-asset options in Lévy models.
method Optimized damping parameters and hierarchical adaptive quadrature.
result Significant speed-up in computational time for up to six dimensions.

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 ↗