Gaussian Processes for Big Data
read the original abstract
We introduce stochastic variational inference for Gaussian process models. This enables the application of Gaussian process (GP) models to data sets containing millions of data points. We show how GPs can be vari- ationally decomposed to depend on a set of globally relevant inducing variables which factorize the model in the necessary manner to perform variational inference. Our ap- proach is readily extended to models with non-Gaussian likelihoods and latent variable models based around Gaussian processes. We demonstrate the approach on a simple toy problem and two real world data sets.
This paper has not been read by Pith yet.
Forward citations
Cited by 8 Pith papers
-
Conditioning Gaussian Processes on Almost Anything
Equivalence between Gaussian processes and linear diffusion models enables general conditioning on arbitrary pointwise likelihoods via ODE dynamics and Monte Carlo guidance approximation.
-
Rates of forgetting for the sequentially Markov coalescent
SMC forgets its initial condition geometrically in the jump chain and as 1/ℓ in continuous genetic distance, justifying independent-locus approximations.
-
Concepts Worth Having: Refining VLM-Guided Concept Bottleneck Models with Minimal Annotations
VH-CBM uses a Gaussian process in VLM embedding space to propagate sparse human annotations and improve concept accuracy and calibration over pure VLM-guided concept bottleneck models.
-
Generative Modeling of Approximately Periodic Time Series by a Posterior-Weighted Gaussian Process
A two-stage posterior-weighted Gaussian Process generates approximately periodic time series by keeping an identical mean function across repetitions while permitting smooth inter-repetition variation.
-
Joint Parameter and State-Space Bayesian Optimization: Using Process Expertise to Accelerate Manufacturing Optimization
POGPN-JPSS integrates partially observable Gaussian process networks with joint parameter and state-space modeling to leverage expert-derived low-dimensional features from high-dimensional intermediate observations fo...
-
A Cubing Strategy for Identifying Stable Hyperparameter Regions for Uncertainty Quantification in Spatial Deep Learning
A recursive cubing framework identifies stable hyperparameter regions for MC dropout uncertainty quantification in spatial deep learning and produces competitive or superior predictive intervals versus a statistical b...
-
Uncertainty-Aware Offline Data-Driven Multi-Objective Optimization
A dual-ranking strategy improves offline data-driven multi-objective optimization by prioritizing solutions that score well on both predicted performance and low uncertainty across different surrogate models.
-
Towards Scalable Gaussian Process Modeling
Implements ASMC in GEBHM to scale GP hyperparameter estimation to large datasets, saving time while maintaining predictability.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.