解决标注成本不一下的批量主动学习问题,降低真实场景的标注开销。
ConBatch-BAL: Batch Bayesian Active Learning under Budget Constraints
- 基于贝叶斯神经网络计算不确定性,动态分配预算或逐次选最优样本。
- 在有限预算下减少迭代次数与标注成本,性能优于无约束基线。
- 适用于高成本标注与地理约束场景,提供两个真实地理影像数据集。
不同数据点的标注成本差异及预算限制会阻碍主动学习在真实场景中的应用。本文提出两种面向预算约束的批量主动学习策略(ConBatch-BAL),一种基于动态阈值,另一种采用贪心采样。二者均通过贝叶斯神经网络计算不确定性来选择样本:动态阈值策略在批次内重新分配预算,贪心策略每步选取剩余预算内排名最高的样本。针对标注成本高且受地理空间限制的应用场景,我们发布了两个新的真实世界数据集,包含带有能效或建筑类型标签的地理定位航空影像。在多种预算和成本条件下,对这些数据集上的策略进行基准测试,结果表明,ConBatch-BAL 能显著减少主动学习迭代次数与数据获取成本,甚至优于无约束基线方案。
原文摘要 · Abstract (English)
Varying annotation costs among data points and budget constraints can hinder the adoption of active learning strategies in real-world applications. This work introduces two Bayesian active learning strategies for batch acquisition under constraints (ConBatch-BAL), one based on dynamic thresholding and one following greedy acquisition. Both select samples using uncertainty metrics computed via Bayesian neural networks. The dynamic thresholding strategy redistributes the budget across the batch, while the greedy one selects the top-ranked sample at each step, limited by the remaining budget. Focusing on scenarios with costly data annotation and geospatial constraints, we also release two new real-world datasets containing geolocated aerial images of buildings, annotated with energy efficiency or typology classes. The ConBatch-BAL strategies are benchmarked against a random acquisition baseline on these datasets under various budget and cost scenarios. The results show that the developed ConBatch-BAL strategies can reduce active learning iterations and data acquisition costs in real-world settings, and even outperform the unconstrained baseline solutions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。