Gaussian Process Quadrature (GPQ)

• Gaussian Process Quadrature (GPQ) is a probabilistic numerical integration method that models integrals via Gaussian processes, yielding both point estimates and calibrated uncertainty.
• It employs various node selection strategies—random, deterministic, and active learning—to enhance accuracy and efficiency in estimating integrals.
• GPQ generalizes classical quadrature rules, offering rigorous theoretical convergence rates and practical guidelines for kernel selection and scalable computational methods.

Gaussian Process Quadrature (GPQ) is a probabilistic framework for numerical integration that models the unknown integrand as a sample from a Gaussian process (GP). By leveraging the GP posterior conditional on observed function evaluations, GPQ delivers both point estimates and quantified uncertainty for integrals, which are crucial in Bayesian inference, filtering, uncertainty propagation, and other scientific computing domains. This approach subsumes classical quadrature rules under specific kernel and node choices and introduces a systematic methodology for model-based integration with rigorous theoretical and practical guarantees (Mahsereci et al., 18 Feb 2026).

1. Mathematical Model and Core Formulation

GPQ addresses the estimation of integrals of the form

$I = \int_D f(x) p(x) \, dx,$

where $D \subseteq \mathbb{R}^d$, $p(x)$ is a known density, and $f$ is unknown but evaluated at a finite set of points. GPQ imposes a Gaussian process prior on $f$,

$f \sim \mathcal{GP}(m(\cdot), k(\cdot,\cdot)),$

with mean function $m: D \to \mathbb{R}$ and positive-definite covariance kernel $k: D \times D \to \mathbb{R}$. Conditioned on $N$ noiseless evaluations $y_i = f(x_i)$ at nodes $D \subseteq \mathbb{R}^d$0, the posterior is again a GP: $D \subseteq \mathbb{R}^d$1 where $D \subseteq \mathbb{R}^d$2 is the kernel matrix on $D \subseteq \mathbb{R}^d$3, $D \subseteq \mathbb{R}^d$4, and $D \subseteq \mathbb{R}^d$5 is the vector of prior means at $D \subseteq \mathbb{R}^d$6.

The posterior distribution for $D \subseteq \mathbb{R}^d$7 is Gaussian, with explicit expressions: $D \subseteq \mathbb{R}^d$8 so that

$D \subseteq \mathbb{R}^d$9

This provides both an estimator and a calibrated uncertainty measure for $p(x)$0 (Mahsereci et al., 18 Feb 2026, Särkkä et al., 2015, Prüher et al., 2017).

2. Node Selection Strategies and Sampling Paradigms

Node selection in GPQ directly controls the efficiency and accuracy of the estimator. Strategies include:

• Random (Bayesian Monte Carlo): Nodes $p(x)$1 sampled i.i.d. from $p(x)$2. Variants employ importance sampling or determinantal point processes to improve coverage or diversity.
• Space-filling deterministic designs: Regular grids and classical Gaussian quadrature rules (e.g., tensorized Gauss–Hermite), or quasi-Monte Carlo sequences (Sobol, lattice) are used for improved uniformity and optimal convergence for smooth integrands.
• Active learning (Myopic or Sequential Design): Nodes are selected adaptively by maximizing an acquisition function, such as negative posterior variance, mutual information, or predictive uncertainty:

$p(x)$3

where $p(x)$4 quantifies value according to the chosen utility criterion. This sequential approach often yields lower posterior variance for a fixed budget (Mahsereci et al., 18 Feb 2026).

3. Taxonomy and Extensions of GPQ

The GPQ methodology can be systematically classified along three axes (Mahsereci et al., 18 Feb 2026):

A. Modelling:

• Conjugate GPQ: Direct GP prior on $p(x)$5 with Gaussian integral posterior (exact).
• Warped or Non-conjugate GPQ: Transformations such as $p(x)$6, $p(x)$7 (e.g. exponentiation for nonnegative integrands), which necessitate approximate inference techniques.

B. Inference:

• Exact/Analytic: Closed-form expressions for posterior mean and variance of the integral.
• Approximate: Required when kernel means or double integrals are intractable; approaches include Laplace approximation, variational Bayes, or kernel quadrature of kernel means.
• Scalable: Sparse-GP, random Fourier features, or kernel interpolation methods reduce cubic scaling to increase tractability for large $p(x)$8.

C. Sampling:

• Static/Model-independent: Node sets chosen without reference to current surrogate model, as in standard grids.
• Sequential/Active: Nodes chosen adaptively by maximizing acquisition functions, targeting maximal reduction in integration uncertainty.

Non-conjugate strategies and scalable inference are especially relevant for high-dimensional or computationally expensive integrations as in modern Bayesian inference pipelines (Li et al., 2023, Hamid et al., 2021).

4. Theoretical Guarantees and Convergence Rates

Let $p(x)$9 denote the reproducing kernel Hilbert space (RKHS) of the kernel $f$0. Define the worst-case error

$f$1

The GPQ weights $f$2 minimize $f$3, and the posterior variance $f$4 equals this minimal RKHS error (Mahsereci et al., 18 Feb 2026).

For $f$5 with a Matérn kernel of smoothness $f$6 (so that $f$7, $f$8), when nodes are quasi-uniform with fill distance $f$9 and $f$0,

$f$1

attaining the optimal Sobolev rate. For Bayesian Monte Carlo (random nodes),

$f$2

for all $f$3, matching classical Monte Carlo but often with smaller constants (Mahsereci et al., 18 Feb 2026).

5. Computational Complexity and Scalability

Classical GPQ has cubic computational complexity in the number of nodes: forming and inverting the kernel matrix $f$4 costs $f$5 flops and $f$6 memory. Kernel means and double integrals ($f$7, $f$8) require either closed form or secondary quadrature techniques. Numerical stability is enhanced by adding a small diagonal nugget $f$9 to $f \sim \mathcal{GP}(m(\cdot), k(\cdot,\cdot)),$0 (Mahsereci et al., 18 Feb 2026).

Scalable variants involve:

• Sparse-GP surrogates (inducing points) with cost $f \sim \mathcal{GP}(m(\cdot), k(\cdot,\cdot)),$1, $f \sim \mathcal{GP}(m(\cdot), k(\cdot,\cdot)),$2 (Li et al., 2023).
• Random Fourier features and kernel interpolation for efficient kernel approximation (Mahsereci et al., 18 Feb 2026).
• Quantum acceleration: Quantum Gaussian Process Quadrature combines Hilbert-space kernel approximation with quantum algorithms (phase estimation, qPCA, Hadamard/SWAP tests), yielding gate complexity polylogarithmic in problem size and a polynomial speedup over classical methods for large-scale settings (Galvis-Florez et al., 20 Feb 2025).

6. Practical Guidelines, Applications, and Limitations

Practical Guidance

• Kernel selection: Choice of kernel (e.g., Matérn with $f \sim \mathcal{GP}(m(\cdot), k(\cdot,\cdot)),$3) should match prior smoothness assumptions on $f \sim \mathcal{GP}(m(\cdot), k(\cdot,\cdot)),$4.
• Prior mean: Zero mean is generally sufficient; trends can be handled via explicit basis functions.
• Hyperparameters: Set by marginal likelihood or cross-validation; beware of overfitting, especially in adaptive node schemes. Use an initial space-filling design to mitigate this.
• Numerical Stability: Add minimal necessary jitter/nugget to $f \sim \mathcal{GP}(m(\cdot), k(\cdot,\cdot)),$5.
• Software: Implementations include EmuKit and ProbNum (Python), GAIL (MATLAB), and standard GP libraries (GPy, GPflow, GPyTorch) for custom code.

Applications

GPQ is widely applied for:

• Bayesian numerical integration (e.g., marginal likelihoods, model evidence) (Mahsereci et al., 18 Feb 2026, Hamid et al., 2021).
• Bayesian inference with black-box likelihoods, particularly using post-process or variational sparse GPQ (Li et al., 2023).
• Moment transforms in nonlinear filtering and smoothing, as a principled replacement for unscented or Gauss–Hermite transforms (Prüher et al., 2017, Särkkä et al., 2015).
• Uncertainty quantification and computational statistics, such as kernel-marginalisation for hypermodel selection (Hamid et al., 2021).

Limitations

• Kernel mean requirement: Closed-form kernel means are available only for particular kernels and measures (notably, Gaussian densities with RBF or polynomial kernels), restricting general applicability.
• Cubic scaling: For large $f \sim \mathcal{GP}(m(\cdot), k(\cdot,\cdot)),$6, classical GPQ becomes impractical unless approximate methods are used.
• Active selection caveats: Overfitting can degrade uncertainty quantification, emphasizing the need for regularization and robust hyperparameter settings.

7. Connections to Classical Quadrature and Sigma-Point Methods

GPQ generalizes and subsumes all classical sigma-point quadrature methods:

Classical Rule	GP Kernel	Node Set	GPQ Specialization
Unscented Transform (UT)	Polynomial, deg. 3	$f \sim \mathcal{GP}(m(\cdot), k(\cdot,\cdot)),$7 sym. sigmapoints	Exact for degree-3 polynomials
Gauss–Hermite (GH)	Tensor-poly, deg. $f \sim \mathcal{GP}(m(\cdot), k(\cdot,\cdot)),$8	Product of 1D GH roots	Exact for degree $f \sim \mathcal{GP}(m(\cdot), k(\cdot,\cdot)),$9 polynomials
Cubature (CKF etc.)	Poly, deg. 3	Axis-aligned sym. points	Relation to high-order, symmetric rules

For suitable kernels and nodes, GPQ recovers classical weights and achieves zero posterior variance when the integrand is in the span of the model. Employing smooth (e.g., squared-exponential) kernels and Bayes-optimal or quasi-random nodes, GPQ often attains lower RMSE and superior uncertainty quantification relative to traditional quadratures in moderate-dimensional, smooth-integration regimes (Särkkä et al., 2015, Prüher et al., 2017). GPQ enables principled construction of new, low-variance, and adaptive quadrature schemes for advanced estimation and filtering applications.