Decision-aware training of spatiotemporal forecasting models to select a top K subset of sites for intervention
Not on the map. Why?
Abstract (arXiv)
Optimal allocation of scarce resources is a common problem for decision makers faced with choosing a limited number of locations for intervention. Spatiotemporal prediction models could make such decisions data-driven. A recent performance metric called fraction of best possible reach (BPR) measures the impact of using a model's recommended size K subset of sites compared to the best possible top-K in hindsight. We tackle two open problems related to BPR. First, we explore how to rank all sites numerically given a probabilistic model that predicts event counts jointly across sites. Ranking via the per-site mean is suboptimal for BPR. Instead, we offer a better ranking for BPR backed by decision theory. Second, we explore how to train a probabilistic model's parameters to maximize BPR. Discrete selection of K sites implies all-zero parameter gradients which prevent standard gradient training. We overcome this barrier via advances in perturbed optimizers. We further suggest a training objective that combines likelihood with a decision-aware BPR constraint to deliver high-quality top-K rankings as well as good forecasts for all sites. We demonstrate our approach on two where-to-intervene applications: mitigating opioid-related fatal overdoses for public health and monitoring endangered wildlife.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 52 references that are in the map. First posted on arXiv 7 Mar 2025.
Builds on
16 of 52 references.
References · 16
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2017Smart "Predict, then Optimize"cited by 339
- 2013Black Box Variational Inferencecited by 319
- 2019Monte Carlo Gradient Estimation in Machine Learningcited by 283
- 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 130
- 2023A Survey of Contextual Optimization Methods for Decision Making under Uncertaintycited by 82
- 2020Learning with Differentiable Perturbed Optimizerscited by 81
- 2021Differentiable Patch Selection for Image Recognitioncited by 68
- 2023Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspectivecited by 26
- 2019Variational Bayesian Decision-making for Continuous Utilitiescited by 16
- 2024Decision-Focused Learning with Directional Gradientscited by 16
- 2022Decision-Aware Learning for Optimizing Health Supply Chainscited by 14
4 more
- 2020Direct loss minimization algorithms for sparse Gaussian processescited by 10
- 2021CARMS: Categorical-Antithetic-REINFORCE Multi-Sample Gradient Estimatorcited by 4
- 2019CASTNet: Community-Attentive Spatio-Temporal Networks for Opioid Overdose Forecastingcited by 3
- 2017Machine Learning for Drug Overdose Surveillancecited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.