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

动态多样化的增量覆盖树的紧界

Tight Bound of Incremental Cover Trees for Dynamic Diversification

Hannah Marienwald, Wikor Pronobis, Klaus-Robert Müller, Shinichi Nakajima

摘要:

动态多样化-从时间相关的样本池中找到一组具有最大多样性的数据点-是推荐系统、网络搜索、数据库搜索和通知服务中的一项重要任务,以避免向用户显示重复或非常相似的项目。增量覆盖树(ICT)具有计算效率高、灵活性强的特点,已被应用于该任务中,并表现出良好的性能。具体地,根据经验观察到ICT通常提供其多样性仅比贪婪最大-最小(GMM)算法稍微差($\sim 1/ 1.2$倍)的集合,贪婪最大-最小(GMM)算法是静态多样化的最新方法,其性能界限对于任何多项式时间算法都是最优的。然而,ICT的已知性能界限比这个最佳界限差4倍。通过本文,我们的目标是填补理论和经验观察之间的这一空白。为了实现这一目标,我们首先分析了ICT方法的变体,并推导出更严格的性能界限。然后,我们调查之间的差距,通过使用专门设计的人工数据的最佳多样性是已知的。最后,我们分析了界限的紧性,并表明界限不能进一步提高,即,这篇文章为ICT方法提供了最严格的可能界限。此外,我们展示了一个新的使用动态多样化的生成图像采样器,其中原型是从一个图像采样器生成的人工图像流中逐步收集。

英文摘要:

Dynamic diversification---finding a set of data points with maximum diversity from a time-dependent sample pool---is an important task in recommender systems, web search, database search, and notification services, to avoid showing users duplicate or very similar items. The incremental cover tree (ICT) with high computational efficiency and flexibility has been applied to this task, and shown good performance. Specifically, it was empirically observed that ICT typically provides a set with its diversity only marginally ($\sim 1/ 1.2$ times) worse than the greedy max-min (GMM) algorithm, the state-of-the-art method for static diversification with its performance bound optimal for any polynomial time algorithm. Nevertheless, the known performance bound for ICT is 4 times worse than this optimal bound. With this paper, we aim to fill this very gap between theory and empirical observations. For achieving this, we first analyze variants of ICT methods, and derive tighter performance bounds. We then investigate the gap between the obtained bound and empirical observations by using specially designed artificial data for which the optimal diversity is known. Finally, we analyze the tightness of the bound, and show that the bound cannot be further improved, i.e., this paper provides the tightest possible bound for ICT methods. In addition, we demonstrate a new use of dynamic diversification for generative image samplers, where prototypes are incrementally collected from a stream of artificial images generated by an image sampler.

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

↑