English
Related papers

Related papers: Three Costs of Amortizing Gaussian Process Inferen…

200 papers

A variety of infinitely wide neural architectures (e.g., dense NNs, CNNs, and transformers) induce Gaussian process (GP) priors over their outputs. These relationships provide both an accurate characterization of the prior predictive…

We consider the problem of optimizing an unknown (typically non-convex) function with a bounded norm in some Reproducing Kernel Hilbert Space (RKHS), based on noisy bandit feedback. We consider a novel variant of this problem in which the…

Machine Learning · Statistics 2020-03-05 Ilija Bogunovic , Andreas Krause , Jonathan Scarlett

While Gaussian processes (GPs) are the method of choice for regression tasks, they also come with practical difficulties, as inference cost scales cubic in time and quadratic in memory. In this paper, we introduce a natural and expressive…

Machine Learning · Computer Science 2018-09-13 Martin Trapp , Robert Peharz , Carl E. Rasmussen , Franz Pernkopf

This paper addresses the Bayesian optimization problem (also referred to as the Bayesian setting of the Gaussian process bandit), where the learner seeks to minimize the regret under a function drawn from a known Gaussian process (GP).…

Machine Learning · Computer Science 2025-12-12 Shogo Iwazaki

In this paper, we consider the problem of black-box optimization using Gaussian Process (GP) bandit optimization with a small number of batches. Assuming the unknown function has a low norm in the Reproducing Kernel Hilbert Space (RKHS), we…

Machine Learning · Statistics 2022-02-23 Zihan Li , Jonathan Scarlett

Robust generalization is a major challenge in deep learning, particularly when the number of trainable parameters is very large. In general, it is very difficult to know if the network has memorized a particular set of examples or…

Machine Learning · Computer Science 2024-03-06 Darshil Doshi , Aritra Das , Tianyu He , Andrey Gromov

Large-scale Gaussian process inference has long faced practical challenges due to time and space complexity that is superlinear in dataset size. While sparse variational Gaussian process models are capable of learning from large-scale data,…

Machine Learning · Statistics 2018-01-23 Ching-An Cheng , Byron Boots

Probabilistic clustering models (or equivalently, mixture models) are basic building blocks in countless statistical models and involve latent random variables over discrete spaces. For these models, posterior inference methods can be…

Machine Learning · Statistics 2020-06-24 Ari Pakman , Yueqi Wang , Catalin Mitelut , JinHyung Lee , Liam Paninski

Here we study the problem of learning labels for large text corpora where each text can be assigned a variable number of labels. The problem might seem trivial when the label dimensionality is small and can be easily solved using a series…

Machine Learning · Computer Science 2016-11-02 Sayantan Dasgupta

Occupancy prediction infers fine-grained 3D geometry and semantics from camera images of the surrounding environment, making it a critical perception task for autonomous driving. Existing methods either adopt dense grids as scene…

Computer Vision and Pattern Recognition · Computer Science 2025-06-13 Yunxiao Shi , Yinhao Zhu , Shizhong Han , Jisoo Jeong , Amin Ansari , Hong Cai , Fatih Porikli

The computational cost for inference and prediction of statistical models based on Gaussian processes with Mat\'ern covariance functions scales cubicly with the number of observations, limiting their applicability to large data sets. The…

Statistics Theory · Mathematics 2025-03-04 David Bolin , Vaibhav Mehandiratta , Alexandre B. Simas

We study Gaussian Process Thompson Sampling (GP-TS) for sequential decision-making over compact, continuous action spaces and provide a frequentist regret analysis based on fractional Gaussian process posteriors, without relying on domain…

Statistics Theory · Mathematics 2026-02-17 Somjit Roy , Prateek Jaiswal , Anirban Bhattacharya , Debdeep Pati , Bani K. Mallick

Gaussian processes (GPs) are flexible, probabilistic, nonparametric models widely used in fields such as spatial statistics and machine learning. A drawback of Gaussian processes is their computational cost, with $O(N^3)$ time and $O(N^2)$…

Computation · Statistics 2026-05-20 Filippo Rambelli , Fabio Sigrist

3D semantic occupancy prediction is a cornerstone of robotic perception, yet real-world voxel annotations are inherently corrupted by structural artifacts and dynamic trailing effects. This raises a critical but underexplored question: can…

Computer Vision and Pattern Recognition · Computer Science 2026-03-09 Wenxin Li , Kunyu Peng , Di Wen , Junwei Zheng , Jiale Wei , Mengfei Duan , Yuheng Zhang , Rui Fan , Kailun Yang

Current approaches in approximate inference for Bayesian neural networks minimise the Kullback-Leibler divergence to approximate the true posterior over the weights. However, this approximation is without knowledge of the final application,…

Machine Learning · Statistics 2018-05-11 Adam D. Cobb , Stephen J. Roberts , Yarin Gal

Evaluation of machine learning models typically emphasizes final accuracy, overlooking the cost of adaptation: the cumulative errors incurred while learning from scratch. Guess-and- Learn (G&L) v1.0 addresses this gap by measuring…

Machine Learning · Computer Science 2025-09-01 Roland Arnold

Gaussian processes (GP) are Bayesian non-parametric models that are widely used for probabilistic regression. Unfortunately, it cannot scale well with large data nor perform real-time predictions due to its cubic time cost in the data size.…

Machine Learning · Computer Science 2014-08-12 Jie Chen , Nannan Cao , Kian Hsiang Low , Ruofei Ouyang , Colin Keng-Yan Tan , Patrick Jaillet

Gaussian processes (GP) are Bayesian non-parametric models that are widely used for probabilistic regression. Unfortunately, it cannot scale well with large data nor perform real-time predictions due to its cubic time cost in the data size.…

Machine Learning · Statistics 2013-05-27 Jie Chen , Nannan Cao , Kian Hsiang Low , Ruofei Ouyang , Colin Keng-Yan Tan , Patrick Jaillet

We consider the problem of estimating a rank-1 signal corrupted by structured rotationally invariant noise, and address the following question: how well do inference algorithms perform when the noise statistics is unknown and hence Gaussian…

Information Theory · Computer Science 2022-05-23 Jean Barbier , TianQi Hou , Marco Mondelli , Manuel Sáenz

Using established principles from Statistics and Information Theory, we show that invariance to nuisance factors in a deep neural network is equivalent to information minimality of the learned representation, and that stacking layers and…

Machine Learning · Computer Science 2018-06-29 Alessandro Achille , Stefano Soatto