LGMLJul 25, 2019

A Frobenius norm regularization method for convolutional kernels to avoid unstable gradient problem

arXiv:1907.11235v17 citations
Originality Synthesis-oriented
AI Analysis

This addresses gradient instability in CNNs, which is a critical issue for training deep learning models, though it appears incremental as it builds on existing regularization techniques.

The authors tackled the unstable gradient problem in convolutional neural networks by proposing a Frobenius norm regularization method for convolutional kernels, which bounds singular values around 1 to improve stability and generalizability.

Convolutional neural network is a very important model of deep learning. It can help avoid the exploding/vanishing gradient problem and improve the generalizability of a neural network if the singular values of the Jacobian of a layer are bounded around $1$ in the training process. We propose a new penalty function for a convolutional kernel to let the singular values of the corresponding transformation matrix are bounded around $1$. We show how to carry out the gradient type methods. The penalty is about the structured transformation matrix corresponding to a convolutional kernel. This provides a new regularization method about the weights of convolutional layers.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes