An Interpretable Determinantal Choice Model for Subset Selection
Not on the map. Why?
Abstract (arXiv)
Understanding how subsets of items are chosen from offered sets is critical to assortment planning, wireless network planning, and many other applications. There are two seemingly unrelated subset choice models that capture dependencies between items: intuitive and interpretable random utility models; and tractable determinantal point processes (DPPs). This paper connects the two. First, all DPPs are shown to be random utility models. Next, a determinantal choice model that enjoys the best of both worlds is specified; the model is shown to subsume logistic regression when dependence is minimal, and MNL when dependence is maximally negative. This makes the model interpretable, while retaining the tractability of DPPs. A simulation study verifies that the model can learn a continuum of negative dependencies from data, and an applied study using original experimental data produces novel insights on wireless interference in LoRa networks.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 6 of its 32 references that are in the map. First posted on arXiv 22 Feb 2023.
Builds on
6 of 32 references.
References · 6
- 2019Rank-normalization, folding, and localization: An improved widehatR for assessing convergence of MCMCcited by 90
- 2014Learning the Parameters of Determinantal Point Process Kernelscited by 21
- 2019A Survey on LoRa Networking: Research Problems, Current Solutions and Open Issuescited by 14
- 2016Understanding the limits of LoRaWANcited by 11
- 2016Low Power Wide Area Network Analysis: Can LoRa Scale?cited by 3
- 2018Determinantal thinning of point processes with network learning applicationscited by 2
Built on by
Citing papers per year: 2023: 1.
1 paper.