Sensing Cox Processes via Posterior Sampling and Positive Bases

Mojmir Mutny, Andreas Krause
Proceedings of The 25th International Conference on Artificial Intelligence and Statistics, PMLR 151:6968-6989, 2022.

Abstract

We study adaptive sensing of Cox point processes, a widely used model from spatial statistics. We introduce three tasks: maximization of captured events, search for the maximum of the intensity function and learning level sets of the intensity function. We model the intensity function as a sample from a truncated Gaussian process, represented in a specially constructed positive basis. In this basis, the positivity constraint on the intensity function has a simple form. We show how the minimal description positive basis can be adapted to the covariance kernel, to non-stationarity and make connections to common positive bases from prior works. Our adaptive sensing algorithms use Langevin dynamics and are based on posterior sampling (Cox-Thompson) and top-two posterior sampling (Top2) principles. With latter, the difference between samples serves as a surrogate to the uncertainty. We demonstrate the approach using examples from environmental monitoring and crime rate modeling, and compare it to the classical Bayesian experimental design approach.

Cite this Paper


BibTeX
@InProceedings{pmlr-v151-mutny22a, title = { Sensing Cox Processes via Posterior Sampling and Positive Bases }, author = {Mutny, Mojmir and Krause, Andreas}, booktitle = {Proceedings of The 25th International Conference on Artificial Intelligence and Statistics}, pages = {6968--6989}, year = {2022}, editor = {Camps-Valls, Gustau and Ruiz, Francisco J. R. and Valera, Isabel}, volume = {151}, series = {Proceedings of Machine Learning Research}, month = {28--30 Mar}, publisher = {PMLR}, pdf = {https://proceedings.mlr.press/v151/mutny22a/mutny22a.pdf}, url = {https://proceedings.mlr.press/v151/mutny22a.html}, abstract = { We study adaptive sensing of Cox point processes, a widely used model from spatial statistics. We introduce three tasks: maximization of captured events, search for the maximum of the intensity function and learning level sets of the intensity function. We model the intensity function as a sample from a truncated Gaussian process, represented in a specially constructed positive basis. In this basis, the positivity constraint on the intensity function has a simple form. We show how the minimal description positive basis can be adapted to the covariance kernel, to non-stationarity and make connections to common positive bases from prior works. Our adaptive sensing algorithms use Langevin dynamics and are based on posterior sampling (Cox-Thompson) and top-two posterior sampling (Top2) principles. With latter, the difference between samples serves as a surrogate to the uncertainty. We demonstrate the approach using examples from environmental monitoring and crime rate modeling, and compare it to the classical Bayesian experimental design approach. } }
Endnote
%0 Conference Paper %T Sensing Cox Processes via Posterior Sampling and Positive Bases %A Mojmir Mutny %A Andreas Krause %B Proceedings of The 25th International Conference on Artificial Intelligence and Statistics %C Proceedings of Machine Learning Research %D 2022 %E Gustau Camps-Valls %E Francisco J. R. Ruiz %E Isabel Valera %F pmlr-v151-mutny22a %I PMLR %P 6968--6989 %U https://proceedings.mlr.press/v151/mutny22a.html %V 151 %X We study adaptive sensing of Cox point processes, a widely used model from spatial statistics. We introduce three tasks: maximization of captured events, search for the maximum of the intensity function and learning level sets of the intensity function. We model the intensity function as a sample from a truncated Gaussian process, represented in a specially constructed positive basis. In this basis, the positivity constraint on the intensity function has a simple form. We show how the minimal description positive basis can be adapted to the covariance kernel, to non-stationarity and make connections to common positive bases from prior works. Our adaptive sensing algorithms use Langevin dynamics and are based on posterior sampling (Cox-Thompson) and top-two posterior sampling (Top2) principles. With latter, the difference between samples serves as a surrogate to the uncertainty. We demonstrate the approach using examples from environmental monitoring and crime rate modeling, and compare it to the classical Bayesian experimental design approach.
APA
Mutny, M. & Krause, A.. (2022). Sensing Cox Processes via Posterior Sampling and Positive Bases . Proceedings of The 25th International Conference on Artificial Intelligence and Statistics, in Proceedings of Machine Learning Research 151:6968-6989 Available from https://proceedings.mlr.press/v151/mutny22a.html.

Related Material