activity
20162024
most citedOn Calibration of Modern Neural Networks

1.7k citations · 3.2k across the 31 of their papers we have counts for

collaborators

32 papers

cs.LG2024

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…

stat.ML2024

Theoretical Limitations of Ensembles in the Age of Overparameterization

Niclas Dern, John P. Cunningham, Geoff Pleiss

Classic ensembles generalize better than any single component model. In contrast, recent empirical studies find that modern ensembles of (overparameterized) neural networks may not…

cs.LG2024

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…

cs.LG2023★ 1 cited

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…

cs.LG2023

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…

cs.LG2023

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…

cs.LG2023★ 1 cited

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…

cs.LG2022★ 3 cited

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…

cs.LG2022★ 18 cited

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…

cs.LG2022★ 2 cited

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…

cs.LG2021★ 3 cited

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…

cs.LG2021★ 5 cited

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…

stat.ML2021★ 2 cited

Rectangular Flows for Manifold Learning

Anthony L. Caterini, Gabriel Loaiza-Ganem, Geoff Pleiss +1

Normalizing flows are invertible neural networks with tractable change-of-volume terms, which allow optimization of their parameters to be efficiently performed via maximum likelih…

stat.ML2021★ 2 cited

Scalable Cross Validation Losses for Gaussian Process Models

Martin Jankowiak, Geoff Pleiss

We introduce a simple and scalable method for training Gaussian process (GP) models that exploits cross-validation and nearest neighbor truncation. To accommodate binary and multi-…

cs.LG2021

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.…

cs.LG2021★ 2 cited

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…

stat.ML2020★ 55 cited

Uses and Abuses of the Cross-Entropy Loss: Case Studies in Modern Deep Learning

Elliott Gordon-Rodriguez, Gabriel Loaiza-Ganem, Geoff Pleiss +1

Modern deep learning is primarily an experimental science, in which empirical advances occasionally come at the expense of probabilistic rigor. Here we focus on one such example; n…

cond-mat.str-el2020★ 48 cited

Harnessing Interpretable and Unsupervised Machine Learning to Address Big Data from Modern X-ray Diffraction

Jordan Venderley, Michael Matty, Krishnanand Mallayya +14

The information content of crystalline materials becomes astronomical when collective electronic behavior and their fluctuations are taken into account. In the past decade, improve…

cs.LG2020★ 11 cited

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…

stat.ML2020★ 3 cited

Deep Sigma Point Processes

Martin Jankowiak, Geoff Pleiss, Jacob R. Gardner

We introduce Deep Sigma Point Processes, a class of parametric models inspired by the compositional structure of Deep Gaussian Processes (DGPs). Deep Sigma Point Processes (DSPPs)…

cs.LG2020★ 9 cited

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…

cs.LG2020★ 45 cited

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…

cs.CV2019★ 125 cited

Pseudo-LiDAR++: Accurate Depth for 3D Object Detection in Autonomous Driving

Yurong You, Yan Wang, Wei-Lun Chao +5

Detecting objects such as cars and pedestrians in 3D plays an indispensable role in autonomous driving. Existing approaches largely rely on expensive LiDAR sensors for accurate dep…

cs.LG2019★ 32 cited

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…