Near-Optimal Active Learning of Multi-Output Gaussian Processes
Not on the map. Why?
Abstract (arXiv)
This paper addresses the problem of active learning of a multi-output Gaussian process (MOGP) model representing multiple types of coexisting correlated environmental phenomena. In contrast to existing works, our active learning problem involves selecting not just the most informative sampling locations to be observed but also the types of measurements at each selected location for minimizing the predictive uncertainty (i.e., posterior joint entropy) of a target phenomenon of interest given a sampling budget. Unfortunately, such an entropy criterion scales poorly in the numbers of candidate sampling locations and selected observations when optimized. To resolve this issue, we first exploit a structure common to sparse MOGP models for deriving a novel active learning criterion. Then, we exploit a relaxed form of submodularity property of our new criterion for devising a polynomial-time approximation algorithm that guarantees a constant-factor approximation of that achieved by the optimal set of selected observations. Empirical evaluation on real-world datasets shows that our proposed approach outperforms existing algorithms for active learning of MOGP and single-output GP models.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Nov 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 3; 2024: 1; 2025: 3.
10 papers.
- 2022Safe Active Learning for Multi-Output Gaussian Processescited by 13
- 2023Training-Free Neural Active Learning with Initialization-Robustness Guaranteescited by 5
- 2025ROOT: Rethinking Offline Optimization as Distributional Translation via Probabilistic Bridgecited by 4
- 2025Amortized Safe Active Learning for Real-Time Data Acquisition: Pretrained Neural Policies From Simulated Nonparametric Functionscited by 3
- 2021Convolutional Normalizing Flows for Deep Gaussian Processescited by 2
- 2023Practical Privacy-Preserving Gaussian Process Regression via Secret Sharingcited by 2
- 2024Global Safe Sequential Learning via Efficient Knowledge Transfercited by 1
- 2021Improved active output selection strategy for noisy environmentscited by 0
- 2023Exact and general decoupled solutions of the LMC Multitask Gaussian Process modelcited by 0
- 2025Novel Pivoted Cholesky Decompositions for Efficient Gaussian Process Inferencecited by 0
- 2025ROOT: Rethinking Offline Optimization as Distributional Translation via Probabilistic Bridge19 Sep 2025
- 2025Novel Pivoted Cholesky Decompositions for Efficient Gaussian Process Inference28 Jul 2025
- 2025Amortized Safe Active Learning for Real-Time Data Acquisition: Pretrained Neural Policies From Simulated Nonparametric Functions26 Jan 2025
- 2024Global Safe Sequential Learning via Efficient Knowledge Transfer22 Feb 2024
- 2023Exact and general decoupled solutions of the LMC Multitask Gaussian Process model18 Oct 2023
- 2023Practical Privacy-Preserving Gaussian Process Regression via Secret Sharing26 Jun 2023
- 2023Training-Free Neural Active Learning with Initialization-Robustness Guarantees7 Jun 2023
- 2022Safe Active Learning for Multi-Output Gaussian Processes28 Mar 2022
- 2021Convolutional Normalizing Flows for Deep Gaussian Processes17 Apr 2021
- 2021Improved active output selection strategy for noisy environments10 Jan 2021