1.7k citations · 3.2k across the 31 of their papers we have counts for
23 papers · 1 filter
Computation-Aware Gaussian Processes: Model Selection And Linear-Time Inference
Jonathan Wenger, Kaiwen Wu, Philipp Hennig +3
Model selection in Gaussian processes scales prohibitively with the size of the training dataset, both in time and memory. While many approximations exist, all incur inevitable app…
Approximation-Aware Bayesian Optimization
Natalie Maus, Kyurae Kim, Geoff Pleiss +3
High-dimensional Bayesian optimization (BO) tasks such as molecular design often require 10,000 function evaluations before obtaining meaningful results. While methods like sparse…
Large-Scale Gaussian Processes via Alternating Projection
Kaiwen Wu, Jonathan Wenger, Haydn Jones +2
Training and inference in Gaussian processes (GPs) require solving linear systems with kernel matrices. To address the prohibitive time complexity, r…
CoLA: Exploiting Compositional Structure for Automatic and Efficient Numerical Linear Algebra
Andres Potapczynski, Marc Finzi, Geoff Pleiss +1
Many areas of machine learning and science involve large linear algebra problems, such as eigendecompositions, solving linear systems, computing matrix exponentials, and trace esti…
Sharp Calibrated Gaussian Processes
Alexandre Capone, Geoff Pleiss, Sandra Hirche
While Gaussian processes are a mainstay for various engineering and scientific applications, the uncertainty estimates don't satisfy frequentist guarantees and can be miscalibrated…
Pathologies of Predictive Diversity in Deep Ensembles
Taiga Abe, E. Kelly Buchanan, Geoff Pleiss +1
Classic results establish that encouraging predictive diversity improves performance in ensembles of low-capacity models, e.g. through bagging or boosting. Here we demonstrate that…
Posterior and Computational Uncertainty in Gaussian Processes
Jonathan Wenger, Geoff Pleiss, Marvin Pförtner +2
Gaussian processes scale prohibitively with the size of the dataset. In response, many approximation methods have been developed, which inevitably introduce approximation error. Th…
Deep Ensembles Work, But Are They Necessary?
Taiga Abe, E. Kelly Buchanan, Geoff Pleiss +2
Ensembling neural networks is an effective way to increase accuracy, and can often match the performance of individual larger models. This observation poses a natural question: giv…
Variational Nearest Neighbor Gaussian Process
Luhuan Wu, Geoff Pleiss, John Cunningham
Variational approximations to Gaussian processes (GPs) typically use a small set of inducing points to form a low-rank approximation to the covariance matrix. In this work, we inst…
Preconditioning for Scalable Gaussian Process Hyperparameter Optimization
Jonathan Wenger, Geoff Pleiss, Philipp Hennig +2
Gaussian process hyperparameter optimization requires linear solves with, and log-determinants of, large kernel matrices. Iterative numerical techniques are becoming popular to sca…
The Limitations of Large Width in Neural Networks: A Deep Gaussian Process Perspective
Geoff Pleiss, John P. Cunningham
Large width limits have been a recent focus of deep learning research: modulo computational practicalities, do wider networks outperform narrower ones? Answering this question has…
Hierarchical Inducing Point Gaussian Process for Inter-domain Observations
Luhuan Wu, Andrew Miller, Lauren Anderson +3
We examine the general problem of inter-domain Gaussian Processes (GPs): problems where the GP realization and the noisy observations of that realization lie on different domains.…
Bias-Free Scalable Gaussian Processes via Randomized Truncations
Andres Potapczynski, Luhuan Wu, Dan Biderman +2
Scalable Gaussian Process methods are computationally attractive, yet introduce modeling biases that require rigorous study. This paper analyzes two common techniques: early trunca…
Fast Matrix Square Roots with Applications to Gaussian Processes and Bayesian Optimization
Geoff Pleiss, Martin Jankowiak, David Eriksson +2
Matrix square roots and their inverses arise frequently in machine learning, e.g., when sampling from high-dimensional Gaussians or whitening a…
Convolutional Networks with Dense Connectivity
Gao Huang, Zhuang Liu, Geoff Pleiss +2
Recent work has shown that convolutional networks can be substantially deeper, more accurate, and efficient to train if they contain shorter connections between layers close to the…
Identifying Mislabeled Data using the Area Under the Margin Ranking
Geoff Pleiss, Tianyi Zhang, Ethan R. Elenberg +1
Not all data in a typical training set help with generalization; some samples can be overly ambiguous or outrightly mislabeled. This paper introduces a new method to identify such…
Exact Gaussian Processes on a Million Data Points
Ke Alexander Wang, Geoff Pleiss, Jacob R. Gardner +3
Gaussian processes (GPs) are flexible non-parametric models, with a capacity that grows with the available data. However, computational constraints with standard inference procedur…
GPyTorch: Blackbox Matrix-Matrix Gaussian Process Inference with GPU Acceleration
Jacob R. Gardner, Geoff Pleiss, David Bindel +2
Despite advances in scalable models, the inference tools used for Gaussian processes (GPs) have yet to fully capitalize on developments in computing hardware. We present an efficie…
Constant-Time Predictive Distributions for Gaussian Processes
Geoff Pleiss, Jacob R. Gardner, Kilian Q. Weinberger +1
One of the most compelling features of Gaussian process (GP) regression is its ability to provide well-calibrated posterior distributions. Recent advances in inducing point methods…
Product Kernel Interpolation for Scalable Gaussian Processes
Jacob R. Gardner, Geoff Pleiss, Ruihan Wu +2
Recent work shows that inference for Gaussian processes can be performed efficiently using iterative methods that rely only on matrix-vector multiplications (MVMs). Structured Kern…
On Fairness and Calibration
Geoff Pleiss, Manish Raghavan, Felix Wu +2
The machine learning community has become increasingly concerned with the potential for bias and discrimination in predictive models. This has motivated a growing line of work on w…
On Calibration of Modern Neural Networks
Chuan Guo, Geoff Pleiss, Yu Sun +1
Confidence calibration -- the problem of predicting probability estimates representative of the true correctness likelihood -- is important for classification models in many applic…
Snapshot Ensembles: Train 1, get M for free
Gao Huang, Yixuan Li, Geoff Pleiss +3
Ensembles of neural networks are known to be much more robust and accurate than individual networks. However, training multiple deep networks for model averaging is computationally…