通过优化置信度提升概率编码的分类可靠性
Confidence Optimization for Probabilistic Encoding
- 引入置信度感知机制,修正概率编码下的距离计算
- 用L2正则替代KL散度,更稳定地约束方差
- 适用于BERT、RoBERTa等模型,提升分类性能
概率编码通过向神经网络注入高斯噪声,实现确定性到不确定性状态的平滑过渡,增强泛化能力。然而,高斯噪声的随机性会扭曲分类任务中的点对距离度量。为此,我们提出置信度优化的概率编码(CPE)方法,提升距离可靠性并增强表示学习。具体而言,采用两项关键策略:首先,引入置信度感知机制调整距离计算,确保概率编码分类任务中的一致性与可靠性;其次,用更简单的L2正则项替代依赖不可靠先验假设的传统KL散度方差正则化,直接约束方差。所提方法具有模型无关性,在自然语言分类任务上对BERT和RoBERTa模型的实验表明,该方法显著提升了性能与泛化能力。
原文摘要 · Abstract (English)
Probabilistic encoding introduces Gaussian noise into neural networks, enabling a smooth transition from deterministic to uncertain states and enhancing generalization ability. However, the randomness of Gaussian noise distorts point-based distance measurements in classification tasks. To mitigate this issue, we propose a confidence optimization probabilistic encoding (CPE) method that improves distance reliability and enhances representation learning. Specifically, we refine probabilistic encoding with two key strategies: First, we introduce a confidence-aware mechanism to adjust distance calculations, ensuring consistency and reliability in probabilistic encoding classification tasks. Second, we replace the conventional KL divergence-based variance regularization, which relies on unreliable prior assumptions, with a simpler L2 regularization term to directly constrain variance. The method we proposed is model-agnostic, and extensive experiments on natural language classification tasks demonstrate that our method significantly improves performance and generalization on both the BERT and the RoBERTa model.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。