Active learning is of great interest for many practical applications, especially in industry and the physical sciences, where there is a strong need to minimize the number of costly experiments necessary to train predictive models. However, there remain significant challenges for the adoption of active learning methods in many practical applications. One important challenge is that many methods assume a fixed model, where model hyperparameters are chosen a priori. In practice, it is rarely true that a good model will be known in advance. Existing methods for active learning with model selection typically depend on a medium-sized labeling budget. In this work, we focus on the case of having a very small labeling budget, on the order of a few dozen data points, and develop a simple and fast method for practical active learning with model selection. Our method is based on an underlying pool-based active learner for binary classification using support vector classification with a radial basis function kernel. First we show empirically that our method is able to find hyperparameters that lead to the best performance compared to an oracle model on less separable, difficult to classify datasets, and reasonable performance on datasets that are more separable and easier to classify. Then, we demonstrate that it is possible to refine our model selection method using a weighted approach to trade-off between achieving optimal performance on datasets that are easy to classify, versus datasets that are difficult to classify, which can be tuned based on prior domain knowledge about the dataset.
翻译:积极学习对于许多实际应用,特别是在工业和物理科学中,非常需要最大限度地减少培训预测模型所需的费用昂贵的实验数量。然而,在许多实际应用中,采用积极学习方法仍面临重大挑战。一个重要的挑战是,许多方法都采用固定模型,先行选择模型超参数。在实践中,很少能事先知道一个良好的模型。目前采用模型选择方法的积极学习方法通常取决于中等级标签预算。在这项工作中,我们侧重于一个非常小的标签预算,即几十个数据点的顺序,并开发一个简单和快速的方法,以便用模型选择实际积极学习。我们的方法基于一个基础的集合式积极学习器,使用一个支持性矢量分类,使用一个辐射基函数内核,进行二进制分类。首先,我们从经验上表明,我们的方法能够找到最优的参数,与一个不易分解、难以对数据集进行分类、难以对数据集进行分类和合理的性能,然后用更容易的模型来改进数据分类,然后用最易的分类方法来改进我们的数据分类,然后用最易的分类方法来改进数据。