English
Related papers

Related papers: Scalable Thompson Sampling using Sparse Gaussian P…

200 papers

Gaussian processes (GPs) are typically criticised for their unfavourable scaling in both computational and memory requirements. For large datasets, sparse GPs reduce these demands by conditioning on a small set of inducing variables…

Learning uncertain dynamics models using Gaussian process~(GP) regression has been demonstrated to enable high-performance and safety-aware control strategies for challenging real-world applications. Yet, for computational tractability,…

Optimization and Control · Mathematics 2024-09-17 Manish Prajapat , Amon Lahr , Johannes Köhler , Andreas Krause , Melanie N. Zeilinger

Continuous-time trajectory representations are a powerful tool that can be used to address several issues in many practical simultaneous localization and mapping (SLAM) scenarios, like continuously collected measurements distorted by robot…

Robotics · Computer Science 2017-05-18 Jing Dong , Byron Boots , Frank Dellaert

Gaussian Process (GP) regression is shown to be effective for learning unknown dynamics, enabling efficient and safety-aware control strategies across diverse applications. However, existing GP-based model predictive control (GP-MPC)…

Systems and Control · Electrical Eng. & Systems 2025-05-13 Manish Prajapat , Johannes Köhler , Amon Lahr , Andreas Krause , Melanie N. Zeilinger

Gaussian process (GP) models form a core part of probabilistic machine learning. Considerable research effort has been made into attacking three issues with GP models: how to compute efficiently when the number of data is large; how to…

Machine Learning · Statistics 2015-06-15 James Hensman , Alexander G. de G. Matthews , Maurizio Filippone , Zoubin Ghahramani

Thompson Sampling (TS) is one of the most effective algorithms for solving contextual multi-armed bandit problems. In this paper, we propose a new algorithm, called Neural Thompson Sampling, which adapts deep neural networks for both…

Machine Learning · Computer Science 2022-01-03 Weitong Zhang , Dongruo Zhou , Lihong Li , Quanquan Gu

We introduce a new interpretation of sparse variational approximations for Gaussian processes using inducing points, which can lead to more scalable algorithms than previous methods. It is based on decomposing a Gaussian process as a sum of…

Machine Learning · Statistics 2024-02-27 Jiaxin Shi , Michalis K. Titsias , Andriy Mnih

Bayesian optimization devolves the global optimization of a costly objective function to the global optimization of a sequence of acquisition functions. This inner-loop optimization can be catastrophically difficult if it involves posterior…

Machine Learning · Computer Science 2025-04-02 Taiwo A. Adebiyi , Bach Do , Ruda Zhang

We propose a novel sparse tensor decomposition method, namely Tensor Truncated Power (TTP) method, that incorporates variable selection into the estimation of decomposition components. The sparsity is achieved via an efficient truncation…

Machine Learning · Statistics 2016-05-04 Will Wei Sun , Junwei Lu , Han Liu , Guang Cheng

Gaussian Processes (GPs) are a generic modelling tool for supervised learning. While they have been successfully applied on large datasets, their use in safety-critical applications is hindered by the lack of good performance guarantees. To…

Machine Learning · Statistics 2019-08-27 David Reeb , Andreas Doerr , Sebastian Gerwinn , Barbara Rakitsch

Gaussian processes (GPs) are widely used in nonparametric regression, classification and spatio-temporal modeling, motivated in part by a rich literature on theoretical properties. However, a well known drawback of GPs that limits their use…

Methodology · Statistics 2011-06-29 Anjishnu Banerjee , David Dunson , Surya Tokdar

Thompson Sampling (TS) is an efficient method for decision-making under uncertainty, where an action is sampled from a carefully prescribed distribution which is updated based on the observed data. In this work, we study the problem of…

Machine Learning · Computer Science 2022-06-20 Taylan Kargin , Sahin Lale , Kamyar Azizzadenesheli , Anima Anandkumar , Babak Hassibi

Bayesian optimization (BO) has well-documented merits for optimizing black-box functions with an expensive evaluation cost. Such functions emerge in applications as diverse as hyperparameter tuning, drug discovery, and robotics. BO hinges…

Machine Learning · Statistics 2026-05-28 Qin Lu , Konstantinos D. Polyzos , Bingcong Li , Georgios B. Giannakis

Approximate Thompson sampling with Langevin Monte Carlo broadens its reach from Gaussian posterior sampling to encompass more general smooth posteriors. However, it still encounters scalability issues in high-dimensional problems when…

Machine Learning · Statistics 2024-06-24 Haoyang Zheng , Wei Deng , Christian Moya , Guang Lin

Gaussian process (GP) methods have been widely studied recently, especially for large-scale systems with big data and even more extreme cases when data is sparse. Key advantages of these methods consist in: 1) the ability to provide…

Methodology · Statistics 2024-09-13 Chenyi Lyu , Xingchi Liu , Lyudmila Mihaylova

Bayesian optimization is an effective technique for black-box optimization, but its applicability is typically limited to low-dimensional and small-budget problems due to the cubic complexity of computing the Gaussian process (GP)…

Machine Learning · Computer Science 2025-12-18 Yunyue Wei , Vincent Zhuang , Saraswati Soedarmadji , Yanan Sui

Thompson sampling (TS) is a Bayesian randomized exploration strategy that samples options (e.g., system parameters or control laws) from the current posterior and then applies the selected option that is optimal for a task, thereby…

Machine Learning · Computer Science 2026-02-06 Kaikai Zheng , Dawei Shi , Yang Shi , Long Wang

Gaussian processes are the gold standard for many real-world modeling problems, especially in cases where a model's success hinges upon its ability to faithfully represent predictive uncertainty. These problems typically exist as parts of…

Multi-task learning models using Gaussian processes (GP) have been developed and successfully applied in various applications. The main difficulty with this approach is the computational cost of inference using the union of examples from…

Machine Learning · Computer Science 2012-11-29 Yuyang Wang , Roni Khardon

Standard Gaussian Process (GP) regression, a powerful machine learning tool, is computationally expensive when it is applied to large datasets, and potentially inaccurate when data points are sparsely distributed in a high-dimensional…

Machine Learning · Computer Science 2016-03-08 Z. Zhang , K. Duraisamy , N. A. Gumerov