用正负原型统一建模,让深度网络分类更准且可解释。
A Deep Positive-Negative Prototype Approach to Integrated Prototypical Discriminative Learning
- 将类原型与权重向量统一,构建结构化特征空间
- 无需额外参数,提升类别间分离度和类内紧凑性
- 适合追求模型可解释性与轻量化部署的场景
本文提出一种新型深度正负原型(DPNP)模型,结合原型学习(PbL)与判别方法,提升深度神经网络中类别的紧凑性与可分性。传统原型学习强调可解释性,但难以在复杂场景下生成最优决策边界;而判别方法虽能有效分离类别,却缺乏直观可解释性。DPNP通过统一类原型与权重向量,建立结构化隐空间,实现基于可解释原型的精准分类。利用预训练深度网络作为特征提取器,在隐空间中构建每类的深度正原型(DPP),并将其邻近类的DPP视为隐式负原型,施加排斥力以增强类别间分离。该机制无需额外参数,通过融合交叉熵、原型对齐与分离项的新型损失函数,使特征空间几何更有序,最大化类内紧凑性与类间间隔。实验表明,DPNP可在低维空间中将原型组织为近似规则分布,并在多个数据集上优于现有先进模型,同时使用更小网络。
原文摘要 · Abstract (English)
This paper proposes a novel Deep Positive-Negative Prototype (DPNP) model that combines prototype-based learning (PbL) with discriminative methods to improve class compactness and separability in deep neural networks. While PbL traditionally emphasizes interpretability by classifying samples based on their similarity to representative prototypes, it struggles with creating optimal decision boundaries in complex scenarios. Conversely, discriminative methods effectively separate classes but often lack intuitive interpretability. Toward exploiting advantages of these two approaches, the suggested DPNP model bridges between them by unifying class prototypes with weight vectors, thereby establishing a structured latent space that enables accurate classification using interpretable prototypes alongside a properly learned feature representation. Based on this central idea of unified prototype-weight representation, Deep Positive Prototype (DPP) is formed in the latent space as a representative for each class using off-the-shelf deep networks as feature extractors. Then, rival neighboring class DPPs are treated as implicit negative prototypes with repulsive force in DPNP, which push away DPPs from each other. This helps to enhance inter-class separation without the need for any extra parameters. Hence, through a novel loss function that integrates cross-entropy, prototype alignment, and separation terms, DPNP achieves well-organized feature space geometry, maximizing intra-class compactness and inter-class margins. We show that DPNP can organize prototypes in nearly regular positions within feature space, such that it is possible to achieve competitive classification accuracy even in much lower-dimensional feature spaces. Experimental results on several datasets demonstrate that DPNP outperforms state-of-the-art models, while using smaller networks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。