加速BatchBALD:一个用于主动学习的k-BALD近似族
Speeding Up BatchBALD: A k-BALD Family of Approximations for Active Learning
摘要:
主动学习是一种用于训练具有有限标记数据的机器学习模型的强大方法。一种常用的主动学习技术是BatchBALD,它使用贝叶斯神经网络来查找池集中要标记的信息量最大的点。但是,BatchBALD的计算速度可能非常慢,尤其是对于较大的数据集。在本文中,我们提出了一个新的近似,k-BALD,它使用k-wise互信息条款近似BatchBALD,使其计算成本低得多。MNIST数据集上的结果显示,k-BALD在保持类似性能的同时,明显快于BatchBALD。此外,我们还提出了一种基于近似质量选择k的动态方法,使其对于较大的数据集更有效。
英文摘要:
Active learning is a powerful method for training machine learning models with limited labeled data. One commonly used technique for active learning is BatchBALD, which uses Bayesian neural networks to find the most informative points to label in a pool set. However, BatchBALD can be very slow to compute, especially for larger datasets. In this paper, we propose a new approximation, k-BALD, which uses k-wise mutual information terms to approximate BatchBALD, making it much less expensive to compute. Results on the MNIST dataset show that k-BALD is significantly faster than BatchBALD while maintaining similar performance. Additionally, we also propose a dynamic approach for choosing k based on the quality of the approximation, making it more efficient for larger datasets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。