arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2302.11477cs.LG
收藏

一个可解释的子集选择模型

An Interpretable Determinantal Choice Model for Subset Selection

Cornell University(康奈尔大学)

Sander Aarts, David B. Shmoys, Alex Coy

摘要:

了解如何从提供的集合中选择商品子集对于分类规划、无线网络规划和许多其他应用程序至关重要。有两种看似无关的子集选择模型可以捕捉项目之间的依赖关系:直观和可解释的随机效用模型;以及易处理的决定点过程(DPP)。本文将两者联系起来。首先,所有的DPP被证明是随机效用模型。接下来,一个决定性的选择模型,享有最好的两个世界的指定,该模型被证明substantially logistic回归时的依赖是最小的,和MNL时的依赖是最大的负面。这使得模型具有可解释性,同时保留了DPP的易处理性。仿真研究验证了该模型可以从数据中学习连续的负相关性,并且使用原始实验数据的应用研究对LoRa网络中的无线干扰产生了新的见解。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑