arXiv:2602.04574cs.LG2026-02被引 1

用图扩散法高效估算图像标签的不确定性,降低标注成本。

Probabilistic Label Spreading: Efficient and Consistent Estimation of Soft Labels with Epistemic Uncertainty on Graphs

  • 基于图结构传播单个标注,自动估计标签不确定性
  • 即使每张图只有少量标注,也能得到一致的概率估计
  • 适合需要高质量标签但标注资源有限的场景

感知任务中的安全人工智能仍面临重大挑战,部分原因在于高质量标注数据稀缺。标注本身存在认知不确定性和随机不确定性,但通常在标注和评估中被忽略。尽管众包可通过多轮标注估算这些不确定性,但在大规模场景下因标注成本过高而不可行。本文提出一种概率标签传播方法,可有效估计标签的随机与认知不确定性。假设标签在特征空间中具有平滑性,采用基于图的扩散机制传播单个标注。我们证明,当每样本标注数趋近于零时,标签传播仍能产生一致的概率估计。本文还提出了该方法的可扩展实现。实验表明,相比基线方法,本方法显著降低了达到目标标签质量所需的标注预算,并在数据驱动图像分类基准上取得新最优性能。

原文摘要 · Abstract (English)

Safe artificial intelligence for perception tasks remains a major challenge, partly due to the lack of data with high-quality labels. Annotations themselves are subject to aleatoric and epistemic uncertainty, which is typically ignored during annotation and evaluation. While crowdsourcing enables collecting multiple annotations per image to estimate these uncertainties, this approach is impractical at scale due to the required annotation effort. We introduce a probabilistic label spreading method that provides reliable estimates of aleatoric and epistemic uncertainty of labels. Assuming label smoothness over the feature space, we propagate single annotations using a graph-based diffusion method. We prove that label spreading yields consistent probability estimators even when the number of annotations per data point converges to zero. We present and analyze a scalable implementation of our method. Experimental results indicate that, compared to baselines, our approach substantially reduces the annotation budget required to achieve a desired label quality on common image datasets and achieves a new state of the art on the Data-Centric Image Classification benchmark.

标签不确定性图神经网络标注效率

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。