HiGP: A high-performance Python package for Gaussian Process

• URL: http://arxiv.org/abs/2503.02259v1
• Date: Tue, 04 Mar 2025 04:17:36 GMT
• Title: HiGP: A high-performance Python package for Gaussian Process
• Authors: Hua Huang, Tianshi Xu, Yuanzhe Xi, Edmond Chow,
• Abstract summary: HiGP is a high-performance Python package designed for efficient Gaussian Process regression (GPR) and classification (GPC)<n>It implements various effective matrix-vector (MatVec) and matrix-matrix (MatMul) multiplication strategies specifically tailored for kernel matrices.<n>With a user-friendly Python interface, HiGP integrates seamlessly with PyTorch and other Python packages, allowing easy incorporation into existing machine learning and data analysis.
• Score: 13.127443064937735
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Gaussian Processes (GPs) are flexible, nonparametric Bayesian models widely used for regression and classification tasks due to their ability to capture complex data patterns and provide uncertainty quantification (UQ). Traditional GP implementations often face challenges in scalability and computational efficiency, especially with large datasets. To address these challenges, HiGP, a high-performance Python package, is designed for efficient Gaussian Process regression (GPR) and classification (GPC) across datasets of varying sizes. HiGP combines multiple new iterative methods to enhance the performance and efficiency of GP computations. It implements various effective matrix-vector (MatVec) and matrix-matrix (MatMul) multiplication strategies specifically tailored for kernel matrices. To improve the convergence of iterative methods, HiGP also integrates the recently developed Adaptive Factorized Nystrom (AFN) preconditioner and employs precise formulas for computing the gradients. With a user-friendly Python interface, HiGP seamlessly integrates with PyTorch and other Python packages, allowing easy incorporation into existing machine learning and data analysis workflows.

Related papers

• EvoGP: A GPU-accelerated Framework for Tree-based Genetic Programming [8.571010338499422]
  Tree-based Genetic Programming (TGP) is a key evolutionary algorithm widely used in symbolic regression, feature engineering, and scientific modeling. To address these challenges, we introduce EvoGP, a comprehensive GPU-accelerated TGP framework. We show that EvoGP achieves up to a 140.89x speedup over the state-of-the-art TGP implementation.
  arXiv  Detail & Related papers  (2025-01-21T07:42:54Z)
• A Kronecker product accelerated efficient sparse Gaussian Process (E-SGP) for flow emulation [2.563626165548781]
  This paper introduces an efficient sparse Gaussian process (E-SGP) for the surrogate modelling of fluid mechanics. It is a further development of the approximated sparse GP algorithm, combining the concept of efficient GP (E-GP) and variational energy free sparse Gaussian process (VEF-SGP)
  arXiv  Detail & Related papers  (2023-12-13T11:29:40Z)
• GP+: A Python Library for Kernel-based learning via Gaussian Processes [0.0]
  We introduce GP+, an open-source library for kernel-based learning via Gaussian processes (GPs) GP+ is built on PyTorch and provides a user-friendly and object-oriented tool for probabilistic learning and inference.
  arXiv  Detail & Related papers  (2023-12-12T19:39:40Z)
• Actually Sparse Variational Gaussian Processes [20.71289963037696]
  We propose a new class of inter-domain variational GP constructed by projecting a GP onto a set of compactly supported B-spline basis functions. This allows us to very efficiently model fast-varying spatial phenomena with tens of thousands of inducing variables.
  arXiv  Detail & Related papers  (2023-04-11T09:38:58Z)
• Sparse high-dimensional linear regression with a partitioned empirical Bayes ECM algorithm [62.997667081978825]
  We propose a computationally efficient and powerful Bayesian approach for sparse high-dimensional linear regression. Minimal prior assumptions on the parameters are used through the use of plug-in empirical Bayes estimates. The proposed approach is implemented in the R package probe.
  arXiv  Detail & Related papers  (2022-09-16T19:15:50Z)
• Surrogate modeling for Bayesian optimization beyond a single Gaussian process [62.294228304646516]
  We propose a novel Bayesian surrogate model to balance exploration with exploitation of the search space. To endow function sampling with scalability, random feature-based kernel approximation is leveraged per GP model. To further establish convergence of the proposed EGP-TS to the global optimum, analysis is conducted based on the notion of Bayesian regret.
  arXiv  Detail & Related papers  (2022-05-27T16:43:10Z)
• Scaling Gaussian Process Optimization by Evaluating a Few Unique Candidates Multiple Times [119.41129787351092]
  We show that sequential black-box optimization based on GPs can be made efficient by sticking to a candidate solution for multiple evaluation steps. We modify two well-established GP-Opt algorithms, GP-UCB and GP-EI to adapt rules from batched GP-Opt.
  arXiv  Detail & Related papers  (2022-01-30T20:42:14Z)
• Non-Gaussian Gaussian Processes for Few-Shot Regression [71.33730039795921]
  We propose an invertible ODE-based mapping that operates on each component of the random variable vectors and shares the parameters across all of them. NGGPs outperform the competing state-of-the-art approaches on a diversified set of benchmarks and applications.
  arXiv  Detail & Related papers  (2021-10-26T10:45:25Z)
• Accelerating Genetic Programming using GPUs [0.0]
  Genetic Programming (GP) has multiple applications in machine learning such as curve fitting, data modelling, feature selection, classification etc. This paper describes a GPU accelerated stack-based variant of the generational GP algorithm which can be used for symbolic regression and binary classification.
  arXiv  Detail & Related papers  (2021-10-15T06:13:01Z)
• Incremental Ensemble Gaussian Processes [53.3291389385672]
  We propose an incremental ensemble (IE-) GP framework, where an EGP meta-learner employs an it ensemble of GP learners, each having a unique kernel belonging to a prescribed kernel dictionary. With each GP expert leveraging the random feature-based approximation to perform online prediction and model update with it scalability, the EGP meta-learner capitalizes on data-adaptive weights to synthesize the per-expert predictions. The novel IE-GP is generalized to accommodate time-varying functions by modeling structured dynamics at the EGP meta-learner and within each GP learner.
  arXiv  Detail & Related papers  (2021-10-13T15:11:25Z)
• MOGPTK: The Multi-Output Gaussian Process Toolkit [71.08576457371433]
  We present MOGPTK, a Python package for multi-channel data modelling using Gaussian processes (GP) The aim of this toolkit is to make multi-output GP (MOGP) models accessible to researchers, data scientists, and practitioners alike.
  arXiv  Detail & Related papers  (2020-02-09T23:34:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.