Bayesian optimization for sensor set selection
Roman Garnett,Michael A. Osborne,Stephen J. Roberts +2 more
- 12 Apr 2010
- pp 209-219
TL;DR: A natural metric is introduced between sets of sensors that can be used to construct covariance functions over sets, and thereby perform Gaussian process inference over a function whose domain is a power set.
read more
Abstract: We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric between pairs of set elements, we introduce a natural metric between sets of sensors for this task. Using this metric, we can construct covariance functions over sets, and thereby perform Gaussian process inference over a function whose domain is a power set. If the function has additional inputs, our covariances can be readily extended to incorporate them---allowing us to consider, for example, functions over both sets and time. These functions can then be optimized using Gaussian process global optimization (GPGO). We use the root mean squared error (RMSE) of the predictions made using a set of sensors at a particular time as an example of such a function to be optimized; the optimal point specifies the best choice of sensor locations. We demonstrate the resulting method by dynamically selecting the best subset of a given set of weather sensors for the prediction of the air temperature across the United Kingdom.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Taking the Human Out of the Loop: A Review of Bayesian Optimization
Bobak Shahriari,Kevin Swersky,Ziyu Wang,Ryan P. Adams,Nando de Freitas +4 more
- 01 Jan 2016
TL;DR: This review paper introduces Bayesian optimization, highlights some of its methodological aspects, and showcases a wide range of applications.
•Posted Content
A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning
TL;DR: Bayesian optimization as mentioned in this paper employs the Bayesian technique of setting a prior over the objective function and combining it with evidence to get a posterior function, which permits a utility-based selection of the next observation to make on the objective functions, which must take into account both exploration (sampling from areas of high uncertainty) and exploitation, sampling areas likely to offer improvement over the current best observation.
2K
•Proceedings Article
Scalable Bayesian Optimization Using Deep Neural Networks
Jasper Snoek,Oren Rippel,Oren Rippel,Kevin Swersky,Ryan Kiros,Nadathur Satish,Narayanan Sundaram,Md. Mostofa Ali Patwary,Prabhat,Ryan P. Adams +9 more
- 06 Jul 2015
TL;DR: This work shows that performing adaptive basis function regression with a neural network as the parametric form performs competitively with state-of-the-art GP-based approaches, but scales linearly with the number of data rather than cubically, which allows for a previously intractable degree of parallelism.
•Posted Content
Scalable Bayesian Optimization Using Deep Neural Networks
Jasper Snoek,Oren Rippel,Oren Rippel,Kevin Swersky,Ryan Kiros,Nadathur Satish,Narayanan Sundaram,Md. Mostofa Ali Patwary,Prabhat,Ryan P. Adams +9 more
TL;DR: In this article, the authors explore the use of neural networks as an alternative to GPs to model distributions over functions, and show that performing adaptive basis function regression with a neural network as the parametric form performs competitively with state-of-the-art GP-based approaches, but scales linearly with the number of data rather than cubically.
654
Bayesian optimization for learning gaits under uncertainty
TL;DR: Bayesian optimization, a model-based approach to black-box optimization under uncertainty, is evaluated on both simulated problems and real robots, demonstrating that Bayesian optimization is particularly suited for robotic applications, where it is crucial to find a good set of gait parameters in a small number of experiments.
References
Advances in Neural Information Processing Systems 14
08 Nov 2002
Abstract: The proceedings of the 2001 Neural Information Processing Systems (NIPS) Conference. The annual conference on Neural Information Processing Systems (NIPS) is the flagship conference on neural computation. The conference is interdisciplinary, with contributions in algorithms, learning theory, cognitive science, neuroscience, vision, speech and signal processing, reinforcement learning and control, implementations, and diverse applications. Only about 30 percent of the papers submitted are accepted for presentation at NIPS, so the quality is exceptionally high. These proceedings contain all of the papers that were presented at the 2001 conference. Bradford Books imprint
8.9K
Efficient Global Optimization of Expensive Black-Box Functions
TL;DR: This paper introduces the reader to a response surface methodology that is especially good at modeling the nonlinear, multimodal functions that often occur in engineering and shows how these approximating functions can be used to construct an efficient global optimization algorithm with a credible stopping rule.
The Earth Mover's Distance as a Metric for Image Retrieval
TL;DR: This paper investigates the properties of a metric between two distributions, the Earth Mover's Distance (EMD), for content-based image retrieval, and compares the retrieval performance of the EMD with that of other distances.
Efficient Global Optimization of Expensive Black-Box Functions
Donald R. Jones,Matthias Schonlau,William J. Welch +2 more
TL;DR: This paper introduces the reader to a response surface methodology that is especially good at modeling the nonlinear, multimodal functions that often occur in engineering and shows how these approximating functions can be used to construct an efficient global optimization algorithm with a credible stopping rule.
2.7K
A Taxonomy of Global Optimization Methods Based on Response Surfaces
TL;DR: This paper presents a taxonomy of existing approaches for using response surfaces for global optimization, illustrating each method with a simple numerical example that brings out its advantages and disadvantages.