Near-optimal sensor placements in gaussian processes

Near-optimal sensor placements in gaussian processes (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Andreas Krause , Ajit Singh , Carlos Guestrin , Chris Williams

Venue:	In ICML
Citations:	143 - 25 self

BibTeX

@INPROCEEDINGS{Krause05near-optimalsensor,
    author = {Andreas Krause and Ajit Singh and Carlos Guestrin and Chris Williams},
    title = {Near-optimal sensor placements in gaussian processes},
    booktitle = {In ICML},
    year = {2005},
    publisher = {ICML}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to address this task, for example, geometry or disk models, placing sensors at the points of highest entropy (variance) in the GP model, and A-, D-, or E-optimal design. In this paper, we tackle the combinatorial optimization problem of maximizing the mutual information between the chosen locations and the locations which are not selected. We prove that the problem of finding the configuration that maximizes mutual information is NP-complete. To address this issue, we describe a polynomial-time approximation that is within (1 − 1/e) of the optimum by exploiting the submodularity of mutual information. We also show how submodularity can be used to obtain online bounds, and design branch and bound search procedures. We then extend our algorithm to exploit lazy evaluations and local structure in the GP, yielding significant speedups. We also extend our approach to find placements which are robust against node failures and uncertainties in the model. These extensions are again associated with rigorous theoretical approximation guarantees, exploiting the submodularity of the objective function. We demonstrate the advantages of our approach towards optimizing mutual information in a very extensive empirical study on two real-world data sets.

Citations

7986	Elements of Information Theory - Cover, Thomas - 1991
1823	Matrix computations - Golub, Loan - 1996
1061	2003): Information Theory, Inference, and Learning Algorithms - MacKay
1019	Statistics for spatial data - Cressie - 1993
353	A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21 Ž - McKay, Conover, et al. - 1979
350	An Analysis of Approximations for Maximizing Submodular Set Functions - Nemhauser, Wolsey, et al. - 1978
310	Model-driven data acquisition in sensor networks - Deshpande, Guestrin, et al. - 2004
184	Approximation schemes for covering and packing problems in image processing and VLSI - Hochbaum, Maass - 1985
63	A randomized art gallery algorithm for sensor placement - Gonzales-Baños, Latombe - 2001
61	Gaussian processes for machine learning - Seeger - 2004
45	An exact algorithm for maximum entropy sampling - Ko, Lee, et al. - 1995
26	A Note on the Budgeted Maximization of Submodular Functions - Krause, Guestrin - 2005
26	Nonstationary Gaussian Processes for Regression and Spatial Modelling - Paciorek - 2003
16	Gaussian processes for active data mining of spatial aggregates - RAMAKRISHNAN, BAILEY-KELLOGG, et al. - 2005
11	Diggle P: geo{R}: a package for geostatistical analysis - Jr
7	A review of some exchange algorithms for constructing D-optimal designs - Nguyen, Miller - 1992
6	Truncated covariance matrices and Toeplitz metlmds in Gaussian processes - Storkey - 1999