arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.06064cs.LGstat.ML
收藏

寻找深层神经网络平坦极小点的邻域平滑正则化

Neighborhood Region Smoothing Regularization for Finding Flat Minima In Deep Neural Networks

Tsinghua University(清华大学)

Yang Zhao, Hao Zhang

摘要:

由于深度神经网络(DNN)具有严重的过度参数化,正则化技术对于在巨大的假设空间中找到最优解至关重要。在本文中,我们提出了一种有效的正则化技术,称为邻域平滑(NRS)。NRS利用模型将受益于收敛到平坦最小值的发现,并尝试在权重空间中正则化邻域区域以产生近似输出。具体而言,在邻域区域中的模型的输出之间的间隙是由基于Kullback-Leibler散度的定义的度量来衡量的。这个度量提供了类似的见解与最小描述长度原则解释平坦极小。通过最小化这种分歧和经验损失,NRS可以显式地驱动优化器收敛到平坦的最小值。我们通过在CIFAR和ImageNet等常用数据集上跨各种模型架构执行图像分类任务来确认NRS的有效性,其中泛化能力可以普遍提高。此外,我们的经验表明,由NRS发现的最小值将有相对较小的海森特征值相比,传统的方法,这被认为是平坦的最小值的证据。

英文摘要:

Due to diverse architectures in deep neural networks (DNNs) with severe overparameterization, regularization techniques are critical for finding optimal solutions in the huge hypothesis space. In this paper, we propose an effective regularization technique, called Neighborhood Region Smoothing (NRS). NRS leverages the finding that models would benefit from converging to flat minima, and tries to regularize the neighborhood region in weight space to yield approximate outputs. Specifically, gap between outputs of models in the neighborhood region is gauged by a defined metric based on Kullback-Leibler divergence. This metric provides similar insights with the minimum description length principle on interpreting flat minima. By minimizing both this divergence and empirical loss, NRS could explicitly drive the optimizer towards converging to flat minima. We confirm the effectiveness of NRS by performing image classification tasks across a wide range of model architectures on commonly-used datasets such as CIFAR and ImageNet, where generalization ability could be universally improved. Also, we empirically show that the minima found by NRS would have relatively smaller Hessian eigenvalues compared to the conventional method, which is considered as the evidence of flat minima.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑