HiGP: A high-performance Python package for Gaussian Processes

Read full text
Authors: Huang Hua, Tianshi Xu, Yuanzhe Xi, Edmond Chow
Cited by: 2
References: 15

Abstract

Gaussian Processes (GPs) (Rasmussen & Williams, 2005) are flexible, nonparametric Bayesian models widely used for regression and classification because of their ability to capture complex data patterns and quantify predictive uncertainty.However, the 𝒪(𝑛 3 ) computational cost of kernel matrix operations poses a major obstacle to applying GPs at scale.HiGP is a high-performance Python package designed to overcome these scalability limitations through advanced numerical linear algebra and hierarchical kernel representations.It integrates ℋ 2 matrices to achieve near-linear complexity in both storage and computation for spatial datasets, supports on-the-fly kernel evaluation to avoid explicit storage in large-scale problems, and incorporates a robust Adaptive Factorized Nyström (AFN) preconditioner (Zhao et al., 2024) that accelerates convergence of iterative solvers across a broad range of kernel spectra.These computational kernels are implemented in C++ for maximum performance and exposed through Python interfaces, enabling seamless integration with modern machine learning workflows.HiGP also includes analytically derived gradient computations for efficient hyperparameter optimization, avoiding the inefficiencies of automatic differentiation in iterative solvers.By serving as a reusable numerical engine, HiGP complements existing GP frameworks such as GPJax (Pinder & Dodd, 2022), KeOps (Charlier et al., 2021), and GaussianProcesses.jl (Fairbrother et al., 2022), providing a reliable and scalable computational backbone for large-scale Gaussian Process regression and classification.

Fields of Study & Subjects

Gaussian Processes and Bayesian Inference Advanced Multi-Objective Optimization Algorithms Computational Physics and Python Applications

Publication details

Journal / source
The Journal of Open Source Software
Publisher
The Open Journal
Volume
11
Issue
117
Pages
8621–8621
Publication date
10 January 2026