Distributionally Robust Active Learning for Gaussian Process Regression
Not on the map. Why?
Abstract (arXiv)
Gaussian process regression (GPR) or kernel ridge regression is a widely used and powerful tool for nonlinear prediction. Therefore, active learning (AL) for GPR, which actively collects data labels to achieve an accurate prediction with fewer data labels, is an important problem. However, existing AL methods do not theoretically guarantee prediction accuracy for target distribution. Furthermore, as discussed in the distributionally robust learning literature, specifying the target distribution is often difficult. Thus, this paper proposes two AL methods that effectively reduce the worst-case expected error for GPR, which is the worst-case expectation in target distribution candidates. We show an upper bound of the worst-case expected squared error, which suggests that the error will be arbitrarily small by a finite number of data labels under mild conditions. Finally, we demonstrate the effectiveness of the proposed methods through synthetic and real-world datasets.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 29 of its 70 references that are in the map. First posted on arXiv 24 Feb 2025.
Builds on
29 of 70 references.
References · 29
- 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
- 2017On Kernelized Multi-armed Banditscited by 348
- 2018When Gaussian Process Meets Big Data: A Review of Scalable GPscited by 205
- 2018Gaussian Processes and Kernel Methods: A Review on Connections and Equivalencescited by 188
- 2017A Rewriting System for Convex Optimization Problemscited by 178
- 2020On Information Gain and Regret Bounds in Gaussian Process Banditscited by 156
- 2018A Flexible Framework for Multi-Objective Bayesian Optimization using Random Scalarizationscited by 98
- 2018Information Directed Sampling and Bandits with Heteroscedastic Noisecited by 75
- 2023Prediction-Oriented Bayesian Active Learningcited by 60
- 2021Gaussian Process Bandit Optimization with Few Batchescited by 57
- 2021Optimal Order Simple Regret for Gaussian Process Banditscited by 52
- 2021Distributionally Robust Learningcited by 44
17 more
- 2016Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimationcited by 40
- 2017Guarantees for Greedy Maximization of Non-submodular Functions with Applicationscited by 34
- 2022Unifying Approaches in Active Learning and Active Sampling via Fisher Information and Information-Theoretic Quantitiescited by 28
- 2020Active Learning under Label Shiftcited by 23
- 2021Test Distribution-Aware Active Learning: A Principled Approach Against Distribution Shift and Outlierscited by 22
- 2024Transductive Active Learning: Theory and Applicationscited by 22
- 2019Incorporating Unlabeled Data into Distributionally Robust Learningcited by 20
- 2022Improved Convergence Rates for Sparse Approximation Methods in Kernel-Based Learningcited by 18
- 2021Bayesian Optimization for Cascade-type Multi-stage Processescited by 17
- 2023Randomized Gaussian Process Upper Confidence Bound with Tighter Bayesian Regret Boundscited by 16
- 2023Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiencycited by 16
- 2023Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Boundscited by 15
- 2018Distributionally Robust Submodular Maximizationcited by 12
- 2023Sample Path Regularity of Gaussian Processes from the Covariance Kernelcited by 11
- 2021Active learning for distributionally robust level-set estimationcited by 10
- 2020Experimental Design for Overparameterized Learning with Application to Single Shot Deep Active Learningcited by 9
- 2024Active Learning for Level Set Estimation Using Randomized Straddle Algorithmscited by 3
Built on by
Citing papers per year: 2026: 3.
3 papers.