Hawkes Process Multi-armed Bandits for Disaster Search and Rescue
arXiv:2004.01580
Abstract
We propose a novel framework for integrating Hawkes processes with multi-armed bandit algorithms to solve spatio-temporal event forecasting and detection problems when data may be undersampled or spatially biased. In particular, we introduce an upper confidence bound algorithm using Bayesian spatial Hawkes process estimation for balancing the tradeoff between exploiting geographic regions where data has been collected and exploring geographic regions where data is unobserved. We first validate our model using simulated data and then apply it to the problem of disaster search and rescue using calls for service data from hurricane Harvey in 2017. Our model outperforms the state of the art baseline spatial MAB algorithms in terms of cumulative reward and several other ranking evaluation metrics.
References in corpus (7)
- A Contextual-Bandit Approach to Personalized News Article Recommendation
- A Theoretical Analysis of NDCG Type Ranking Measures
- Algorithms for multi-armed bandit problems
- A review on application of data mining techniques to combat natural disasters
- Thompson sampling with the online bootstrap
- Latent Contextual Bandits and their Application to Personalized Recommendations for New Users
- Tick: a Python library for statistical learning, with a particular emphasis on time-dependent modelling