让机器学习模型学会识别不确定情况,关键时刻主动拒绝预测,提升安全性和可信度。
Uncertainty-Driven Reliability: Selective Prediction and Trustworthy Deployment in Modern Machine Learning
- 利用训练过程中的中间快照集成,无需改模型就能实现高效可靠的选择性预测。
- 在差分隐私保护下仍保持良好不确定性估计,首次揭示隐私与不确定性间的权衡机制。
- 发现并拆解了选择性分类性能差距的五大成因,为改进模型可靠性提供明确方向。
机器学习系统在高风险场景中部署日益广泛,可靠性至关重要。本文研究如何通过不确定性估计提升模型的安全性与可信度,聚焦于选择性预测——即模型在置信度低时主动拒绝预测。我们发现,模型训练轨迹中蕴含丰富的不确定性信号,无需修改架构或损失函数即可利用。通过集成中间检查点的预测结果,提出一种轻量级、事后可应用的选择性预测方法,适用于多种任务,避免深度集成的开销,并达到当前最佳性能。关键的是,该方法完全兼容差分隐私(DP),使我们得以研究隐私噪声对不确定性质量的影响。结果显示,多数方法在DP下性能下降,而本方法依然稳健,并提出了分离隐私-不确定性权衡的框架。随后,我们推导出选择性分类误差与理想精度-覆盖率曲线之间差距的有限样本分解,识别出五个可解释的误差来源,澄清了哪些干预措施能缩小差距。这解释了为何校准本身无法解决排序错误,从而推动了改善不确定性排序的方法。最后,我们揭示了不确定性信号可能被对抗性操纵以隐藏错误或拒绝服务,同时维持高准确率,并设计了结合校准审计与可验证推理的防御策略。这些贡献共同推进了可靠机器学习的发展,完善了不确定性估计的评估与防护,使模型不仅精准预测,更能知错自明。
原文摘要 · Abstract (English)
Machine learning (ML) systems are increasingly deployed in high-stakes domains where reliability is paramount. This thesis investigates how uncertainty estimation can enhance the safety and trustworthiness of ML, focusing on selective prediction -- where models abstain when confidence is low. We first show that a model's training trajectory contains rich uncertainty signals that can be exploited without altering its architecture or loss. By ensembling predictions from intermediate checkpoints, we propose a lightweight, post-hoc abstention method that works across tasks, avoids the cost of deep ensembles, and achieves state-of-the-art selective prediction performance. Crucially, this approach is fully compatible with differential privacy (DP), allowing us to study how privacy noise affects uncertainty quality. We find that while many methods degrade under DP, our trajectory-based approach remains robust, and we introduce a framework for isolating the privacy-uncertainty trade-off. Next, we then develop a finite-sample decomposition of the selective classification gap -- the deviation from the oracle accuracy-coverage curve -- identifying five interpretable error sources and clarifying which interventions can close the gap. This explains why calibration alone cannot fix ranking errors, motivating methods that improve uncertainty ordering. Finally, we show that uncertainty signals can be adversarially manipulated to hide errors or deny service while maintaining high accuracy, and we design defenses combining calibration audits with verifiable inference. Together, these contributions advance reliable ML by improving, evaluating, and safeguarding uncertainty estimation, enabling models that not only make accurate predictions -- but also know when to say "I do not know".
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。