When domain experts are needed to perform data annotation for complex machine-learning tasks, reducing annotation effort is crucial in order to cut down time and expenses. For cases when there are no annotations available, one approach is to utilize the structure of the feature space for clustering-based active learning (AL) methods. However, these methods are heavily dependent on how the samples are organized in the feature space and what distance metric is used. Unsupervised methods such as contrastive predictive coding (CPC) can potentially be used to learn organized feature spaces, but these methods typically create high-dimensional features which might be challenging for estimating data density. In this paper, we combine CPC and multiple dimensionality reduction methods in search of functioning practices for clustering-based AL. Our experiments for simulating speech emotion recognition system deployment show that both the local and global topology of the feature space can be successfully used for AL, and that CPC can be used to improve clustering-based AL performance over traditional signal features. Additionally, we observe that compressing data dimensionality does not harm AL performance substantially, and that 2-D feature representations achieved similar AL performance as higher-dimensional representations when the number of annotations is not very low.
翻译:当需要域专家对复杂的机器学习任务进行数据说明时,减少批注努力对于减少时间和费用至关重要。对于没有说明的个案,一种办法是利用基于集群的积极学习方法的特征空间结构;然而,这些方法在很大程度上取决于样品在特征空间中的组织方式以及使用距离度的衡量标准。未经监督的方法,例如对比预测编码(CPC),可以用来学习有组织的特征空间,但这些方法通常会产生高维特征,对估计数据密度可能具有挑战性。在本文中,我们结合CPC和多维度减少方法,以寻找基于集群的AL的实用做法。我们在模拟语音识别系统的部署实验表明,可以成功地将特征空间的本地和全球地形用于AL,并且可以使用CPC来改进基于集群的AL性能,而不是传统的信号特征。此外,我们注意到,在说明的数量不是非常低的情况下,压缩数据维度不会大大损害AL的性能,而2D特征显示作为较高维度的图像也取得了类似的性能。