Sensing Cox Processes via Posterior Sampling and Positive Bases
arXiv:2110.11181
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 an minimal description positive basis can be adapted to the covariance kernel, 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 (\textsc{Cox-Thompson}) and top-two posterior sampling (\textsc{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.
References in corpus (8)
- Spatial and Spatio-Temporal Log-Gaussian Cox Processes: Extending the Geostatistical Paradigm
- The Why and How of Nonnegative Matrix Factorization
- Gaussian Processes and Kernel Methods: A Review on Connections and Equivalences
- Log-concave sampling: Metropolis-Hastings algorithms are fast
- Sampling from a log-concave distribution with compact support with proximal Langevin Monte Carlo
- Wasserstein Control of Mirror Langevin Monte Carlo
- Fast Bayesian Intensity Estimation for the Permanental Process
- Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau