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

序贯社区模式估计

Sequential Community Mode Estimation

IIT Bombay(孟买印度理工学院)

Shubham Anand Jain, Shreyas Goenka, Divyam Bapna, Nikhil Karamchandani, Jayakrishnan Nair

摘要:

我们考虑一个人口,划分成一组社区,并研究通过连续的,随机抽样的个人确定人口中最大的社区的问题。存在多个采样域,称为\emph{boxes},其也划分总体。每个盒子可以由不同社区的个人组成,每个社区又可以分布在多个盒子上。学习代理可以在任何时候从任何选择的盒子中随机抽样(替换)一个个体;当这一过程完成时,代理学习抽样个体所属的社区,以及这个个体是否以前被抽样过。代理的目标是通过优化抽样策略和决策规则,最大限度地减少在\emph{fixed budget}设置中错误识别最大社区的概率。我们提出并分析了新的算法,这个问题,并建立信息理论下的任何算法的错误概率的下限。在几种情况下的兴趣,指数衰减率的错误概率下,我们的算法被证明是最佳的常数因子。所提出的算法通过在真实世界数据集上的仿真进一步验证。

英文摘要:

We consider a population, partitioned into a set of communities, and study the problem of identifying the largest community within the population via sequential, random sampling of individuals. There are multiple sampling domains, referred to as \emph{boxes}, which also partition the population. Each box may consist of individuals of different communities, and each community may in turn be spread across multiple boxes. The learning agent can, at any time, sample (with replacement) a random individual from any chosen box; when this is done, the agent learns the community the sampled individual belongs to, and also whether or not this individual has been sampled before. The goal of the agent is to minimize the probability of mis-identifying the largest community in a \emph{fixed budget} setting, by optimizing both the sampling strategy as well as the decision rule. We propose and analyse novel algorithms for this problem, and also establish information theoretic lower bounds on the probability of error under any algorithm. In several cases of interest, the exponential decay rates of the probability of error under our algorithms are shown to be optimal up to constant factors. The proposed algorithms are further validated via simulations on real-world datasets.

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

↑