arXiv:2603.14768cs.LGstat.ML2026-03

用表面积衡量神经网络决策边界,越平滑越能提升准确率

Understanding the geometry of deep learning with decision boundary volume

  • 基于微分几何原理,用局部表面积量化决策边界复杂度
  • 卷积网络中边界表面积越小,分类准确率越高
  • 适用于图像任务的模型,平滑边界更利于泛化

对于分类任务,深度神经网络的性能由其决策边界的结构决定,该几何特性直接影响模型的准确率和鲁棒性。受经典韦尔管公式启发,本文提出一种通过局部表面体积测量神经网络决策边界的算法,提供理论合理且高效的几何解释方法,适用于深度学习中的高维特征空间。较小的表面体积预期对应更低的模型复杂度和更好的泛化能力。我们在多个图像处理任务中验证,使用卷积架构的模型,决策边界体积与分类准确率呈反比关系;而全连接架构在不同任务间表现较不稳定。因此,对于适配特定数据结构的网络架构,我们证明了更平滑的决策边界能带来更好性能,符合直观预期。

原文摘要 · Abstract (English)

For classification tasks, the performance of a deep neural network is determined by the structure of its decision boundary, whose geometry directly affects essential properties of the model, including accuracy and robustness. Motivated by a classical tube formula due to Weyl, we introduce a method to measure the decision boundary of a neural network through local surface volumes, providing a theoretically justifiable and efficient measure enabling a geometric interpretation of the effectiveness of the model applicable to the high dimensional feature spaces considered in deep learning. A smaller surface volume is expected to correspond to lower model complexity and better generalisation. We verify, on a number of image processing tasks with convolutional architectures that decision boundary volume is inversely proportional to classification accuracy. Meanwhile, the relationship between local surface volume and generalisation for fully connected architecture is observed to be less stable between tasks. Therefore, for network architectures suited to a particular data structure, we demonstrate that smoother decision boundaries lead to better performance, as our intuition would suggest.

决策边界几何分析卷积网络泛化能力

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