用粒子排斥提升神经网络不确定性估计,适配大模型且开销极小
Function Space Diversity for Uncertainty Prediction via Repulsive Last-Layer Ensembles
- 通过最后一层多头结构实现粒子多样性,无需完整深度集成
- 在分布外检测和主动学习中表现优异,保持校准的不确定性输出
- 可无缝接入预训练模型,适合资源受限场景下的不确定性建模
函数空间中的贝叶斯推断因其对过参数化神经网络的鲁棒性而受到关注。然而,对高维函数空间的近似带来诸多挑战。本文通过粒子优化进行函数空间推断,提出实用改进,显著提升不确定性估计能力,并使方法适用于大型预训练网络。研究发现,在输入样本上强制粒子预测多样性会损害模型性能;而使用标签破坏型数据增强或无标签分布外数据可有效提升预测多样性与不确定性估计。此外,利用函数空间形式化对网络参数化无额外限制,仅需一个带多头的单网络即可实现粒子表示,参数与计算量增加极少。该方法可无缝集成至预训练模型中,支持以极低额外成本进行不确定性感知微调。在主动学习、分布外数据检测及分布偏移下的校准不确定性估计任务中均取得竞争力结果,且计算与内存开销极低。
原文摘要 · Abstract (English)
Bayesian inference in function space has gained attention due to its robustness against overparameterization in neural networks. However, approximating the infinite-dimensional function space introduces several challenges. In this work, we discuss function space inference via particle optimization and present practical modifications that improve uncertainty estimation and, most importantly, make it applicable for large and pretrained networks. First, we demonstrate that the input samples, where particle predictions are enforced to be diverse, are detrimental to the model performance. While diversity on training data itself can lead to underfitting, the use of label-destroying data augmentation, or unlabeled out-of-distribution data can improve prediction diversity and uncertainty estimates. Furthermore, we take advantage of the function space formulation, which imposes no restrictions on network parameterization other than sufficient flexibility. Instead of using full deep ensembles to represent particles, we propose a single multi-headed network that introduces a minimal increase in parameters and computation. This allows seamless integration to pretrained networks, where this repulsive last-layer ensemble can be used for uncertainty aware fine-tuning at minimal additional cost. We achieve competitive results in disentangling aleatoric and epistemic uncertainty for active learning, detecting out-of-domain data, and providing calibrated uncertainty estimates under distribution shifts with minimal compute and memory.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。