A homotopy training algorithm for fully connected neural networks

Abstract

In this paper, we present a Homotopy Training Algorithm (HTA) to solve optimization problems arising from fully connected neural networks with complicated structures. The HTA dynamically builds the neural network starting from a simplified version to the fully connected network via adding layers and nodes adaptively. Therefore, the corresponding optimization problem is easy to solve at the beginning and connects to the original model via a continuous path guided by the HTA, which provides a high probability to get a global minimum. By gradually increasing the complexity of model along the continuous path, the HTA gets a rather good solution to the original loss function. This is confirmed by various numerical results including VGG models on CIFAR-10. For example, on the VGG13 model with batch normalization, HTA reduces the error rate by 11.86% on test dataset comparing with the traditional method. Moreover, the HTA also allows us to find the optimal structure for a fully connected neural network by building the neutral network adaptively.

References in corpus (5)

• Very Deep Convolutional Networks for Large-Scale Image Recognition
• Representability of algebraic topology for biomolecules in machine learning based scoring and virtual screening
• Parameter Estimation of Social Forces in Crowd Dynamics Models via a Probabilistic Method
• Singular solutions, repeated roots and completeness for higher-spin chains
• An Equation-By-Equation Method for Solving the Multidimensional Moment Constrained Maximum Entropy Problem

Cited by in corpus (1)

• A Weight Initialization Based on the Linear Product Structure for Neural Networks