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

ProtoBandit:通过多臂老虎机实现高效原型选择

ProtoBandit: Efficient Prototype Selection via Multi-Armed Bandits

Microsoft India(微软印度)

Arghya Roy Chaudhuri, Pratik Jawanpuria, Bamdev Mishra

AI总结:

本研究提出基于多臂老虎机的ProtoBandit框架,通过随机贪心搜索减少相似度比较次数,以更低计算成本实现高质量原型选择,还可用于高效逼近k-中心点聚类的PAM方法BUILD步解。

摘要:

在本研究中,我们提出了一种基于多臂老虎机的框架,用于从源数据集$S$中识别出一组紧凑的、信息丰富的数据实例(即原型),这些实例能最佳地表示给定的目标集$T$。给定数据集的原型样本可为底层数据分布提供可解释的洞察,并辅助基于样本的推理,进而影响人类决策的各个领域。当前最先进的原型选择方法需要在源数据点和目标数据点之间进行$O(|S||T|)$次相似度比较,这在大规模场景下的计算成本会高得令人无法承受。我们提出通过在原型样本空间中采用随机贪心搜索,并结合多臂老虎机来减少相似度比较的次数,从而缓解这一限制。我们的随机算法ProtoBandit仅需$O(k^3|S|)$次相似度比较,即可识别出包含$k$个原型的集合,该复杂度与目标集的大小无关。我们分析得出的一个有趣结论是针对$k$-中心点聚类问题($T = S$的场景):我们证明,算法ProtoBandit能以$O(k^3|S|)$的复杂度,逼近围绕中心点划分(PAM)方法中BUILD步骤的解。实验结果表明,ProtoBandit将相似度计算的调用次数减少了数个数量级(100-1000倍),同时得到的解的质量与最先进方法的解相当。

英文摘要:

In this work, we propose a multi-armed bandit-based framework for identifying a compact set of informative data instances (i.e., the prototypes) from a source dataset $S$ that best represents a given target set $T$. Prototypical examples of a given dataset offer interpretable insights into the underlying data distribution and assist in example-based reasoning, thereby influencing every sphere of human decision-making. Current state-of-the-art prototype selection approaches require $O(|S||T|)$ similarity comparisons between source and target data points, which becomes prohibitively expensive for large-scale settings. We propose to mitigate this limitation by employing stochastic greedy search in the space of prototypical examples and multi-armed bandits for reducing the number of similarity comparisons. Our randomized algorithm, ProtoBandit, identifies a set of $k$ prototypes incurring $O(k^3|S|)$ similarity comparisons, which is independent of the size of the target set. An interesting outcome of our analysis is for the $k$-medoids clustering problem $T = S$ setting) in which we show that our algorithm ProtoBandit approximates the BUILD step solution of the partitioning around medoids (PAM) method in $O(k^3|S|)$ complexity. Empirically, we observe that ProtoBandit reduces the number of similarity computation calls by several orders of magnitudes ($100-1000$ times) while obtaining solutions similar in quality to those from state-of-the-art approaches.

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

↑