Sensing Cox Processes via Posterior Sampling and Positive Bases
Not on the map. Why?
Abstract (arXiv)
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 (textscCox-Thompson) and top-two posterior sampling (textscTop2) 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.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 20 of its 56 references that are in the map. First posted on arXiv 21 Oct 2021.
Builds on
20 of 56 references.
References · 20
- 2021Convex optimizationcited by 2,515
- 2017A Tutorial on Thompson Samplingcited by 433
- 2018Gaussian Processes and Kernel Methods: A Review on Connections and Equivalencescited by 192
- 2018Log-concave sampling: Metropolis-Hastings algorithms are fastcited by 118
- 2016Simple Bayesian Algorithms for Best Arm Identificationcited by 117
- 2016Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreaucited by 84
- 2018Mirrored Langevin Dynamicscited by 61
- 2020Wasserstein Control of Mirror Langevin Monte Carlocited by 55
- 2017Sampling from a log-concave distribution with compact support with proximal Langevin Monte Carlocited by 43
- 2014The Why and How of Nonnegative Matrix Factorizationcited by 34
- 2016Gaussian process emulators for computer experiments with inequality constraintscited by 17
- 2018Efficient Bayesian Inference of Sigmoidal Gaussian Cox Processescited by 17
8 more
- 2013Spatial and Spatio-Temporal Log-Gaussian Cox Processes: Extending the Geostatistical Paradigmcited by 14
- 2016Poisson intensity estimation with reproducing kernelscited by 14
- 2017Finite-dimensional Gaussian approximation with linear inequality constraintscited by 12
- 2017Fast Bayesian Intensity Estimation for the Permanental Processcited by 10
- 2018Large-Scale Cox Process Inference using Variational Fourier Featurescited by 8
- 2015Discovering Valuable Items from Massive Datacited by 6
- 2019Gaussian Process Modulated Cox Processes under Linear Inequality Constraintscited by 4
- 2018Adaptive Policies for Perimeter Surveillance Problemscited by 3
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1.
4 papers.
- 2021Diversified Sampling for Batched Bayesian Optimization with Determinantal Point Processescited by 24
- 2023Submodular Reinforcement Learningcited by 23
- 2022Active Exploration via Experiment Design in Markov Chainscited by 19
- 2022Near-Optimal Multi-Agent Learning for Safe Coverage Controlcited by 11
- 2023Submodular Reinforcement Learning25 Jul 2023
- 2022Near-Optimal Multi-Agent Learning for Safe Coverage Control12 Oct 2022
- 2022Active Exploration via Experiment Design in Markov Chains29 Jun 2022
- 2021Diversified Sampling for Batched Bayesian Optimization with Determinantal Point Processes22 Oct 2021