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

Trend · papers per month

4308601,2891,719 · Jun 202019922001200920172026
48 results for Integrability by quadratures

A new type of quadrature is developed. The Gaussian quadrature, for a given measure, finds optimal values of a function's argument (nodes) and the corresponding weights. In contrast, the Lebesgue quadrature developed in this paper, finds optimal values of function (value-nodes) and the corresponding weights. The Gaussi…

2018-07-17abs ↗pdf ↗

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 ↗

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.

Adaptive Bayesian quadrature (ABQ) is a powerful approach to numerical integration that empirically compares favorably with Monte Carlo integration on problems of medium dimensionality (where non-adaptive quadrature is not competitive). Its key ingredient is an acquisition function that changes as a function of previou…

2019-05-24abs ↗pdf ↗

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.

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.

Integration over non-negative integrands is a central problem in machine learning (e.g. for model averaging, (hyper-)parameter marginalisation, and computing posterior predictive distributions). Bayesian Quadrature is a probabilistic numerical integration technique that performs promisingly when compared to traditional…

2018-12-04abs ↗pdf ↗

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.

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.

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 ↗

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.

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).

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.

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 ↗

The paper addresses numerical integration issues in SV models, proposing a fast regime switching algorithm.

problem Numerical integration challenges in SV models, especially with high precision and low computational time.
method Proposes a fast regime switching algorithm to determine when higher precision arithmetic is needed.
result Shows that numerical quadratures need to be carefully chosen based on model parameters and parameter values.

The paper studies symmetries and conservation laws of non-diagonalisable hydrodynamic systems.

problem Integrating non-diagonalisable hydrodynamic systems of partial differential equations.
method Analysis of gl-regular Nijenhuis operators, splitting Theorem for symmetries and conservation laws, relationship between symmetries and conservation laws.
result The system of partial differential equations is integrable in quadratures.

New filters improve radar target inference in complex scenarios.

problem Improving radar target inference in highly non-linear system models.
method Developed inverse cubature Kalman filter (I-CKF), inverse quadrature Kalman filter (I-QKF), and inverse cubature-quadrature Kalman filter (I-CQKF) for non-linear systems.
result Numerical experiments show improved estimation accuracy compared to existing methods.

Bayesian Probabilistic Integration uses BART for high-dimensional, non-smooth functions.

problem Bayesian quadrature's limitations in high-dimensional or non-smooth functions.
method Bayesian Additive Regression Trees (BART) priors for numerical integration.
result Explicit convergence rates can be obtained in various settings.