Adaptively Solving the Local-Minimum Problem for Deep Neural Networks

Thumbnail Image

Files

2012.13632.pdf (171.4 KB)

Links to Files

https://arxiv.org/abs/2012.13632

Permanent Link

http://hdl.handle.net/11603/20939

Collections

UMBC Mathematics and Statistics Department
UMBC Faculty Collection

Author/Creator

Author/Creator ORCID

Date

Type of Work

journal articles preprints
Text

Department

Program

Citation of Original Publication

Huachuan Wang and James Ting-Ho Lo, Adaptively Solving the Local-Minimum Problem for Deep Neural Networks, https://arxiv.org/abs/2012.13632

Rights

This item is likely protected under Title 17 of the U.S. Copyright Law. Unless on a Creative Commons license, for uses protected by Copyright Law, contact the copyright holder or the author.
Attribution-NonCommercial-NoDerivatives 4.0 International

Subjects

Abstract

This paper aims to overcome a fundamental problem in the theory and application of deep neural networks (DNNs). We propose a method to solve the local minimum problem in training DNNs directly. Our method is based on the cross-entropy loss criterion's convexification by transforming the cross-entropy loss into a risk averting error (RAE) criterion. To alleviate numerical difficulties, a normalized RAE (NRAE) is employed. The convexity region of the cross-entropy loss expands as its risk sensitivity index (RSI) increases. Making the best use of the convexity region, our method starts training with an extensive RSI, gradually reduces it, and switches to the RAE as soon as the RAE is numerically feasible. After training converges, the resultant deep learning machine is expected to be inside the attraction basin of a global minimum of the cross-entropy loss. Numerical results are provided to show the effectiveness of the proposed method.