arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.08387stat.MLcs.LG
收藏

基于分位数搜索的距离惩罚主动学习

Distance-Penalized Active Learning Using Quantile Search

University of Michigan(密歇根大学)

John Lipor, Brandon Wong, Donald Scavia, Branko Kerkez, Laura Balzano

摘要:

自适应抽样论已经表明,通过对信号类别的适当假设,存在用最佳采样数在$\mathbb{R}^{d}$中重构信号的算法。我们将这个问题推广到空间信号的情况下,其中采样成本是一个函数的采样数量和估计过程中行进的距离。这是我们研究五大湖低氧浓度地区的工作的动机。我们表明,对于一维阈值分类器,可以使用二进制搜索,我们称之为分位数搜索的泛化,取得的样本数和距离之间的权衡。我们的特点是固定数量的样本后的估计误差和在无噪声的情况下,以及在有噪声的测量的情况下的估计误差的距离。我们说明了我们的结果在模拟和实验中,并表明我们的方法优于现有的算法在大多数实际情况下。

英文摘要:

Adaptive sampling theory has shown that, with proper assumptions on the signal class, algorithms exist to reconstruct a signal in $\mathbb{R}^{d}$ with an optimal number of samples. We generalize this problem to the case of spatial signals, where the sampling cost is a function of both the number of samples taken and the distance traveled during estimation. This is motivated by our work studying regions of low oxygen concentration in the Great Lakes. We show that for one-dimensional threshold classifiers, a tradeoff between the number of samples taken and distance traveled can be achieved using a generalization of binary search, which we refer to as quantile search. We characterize both the estimation error after a fixed number of samples and the distance traveled in the noiseless case, as well as the estimation error in the case of noisy measurements. We illustrate our results in both simulations and experiments and show that our method outperforms existing algorithms in the majority of practical scenarios.

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

↑