Neural Networks Regularization With Graph-Based Local Resampling

doi:10.1109/ACCESS.2021.3068127

Neural Networks Regularization With Graph-Based Local Resampling

2021-01-01

6

OA

AI

Lourenço R. G. Araújo

DOI：10.1109/ACCESS.2021.3068127

Original

Save

View PDF

Abstract

En 中文

This paper presents the concept of Graph-based Local Resampling of perceptron-like neural networks with random projections (RN-ELM) which aims at regularization of the yielded model. The addition of synthetic noise to the learning set finds some similarity with data augmentation approaches that are currently adopted in many deep learning strategies. With the graph-based approach, however, it is possible to direct resample in the margin region instead of exhaustively cover the whole input space. The goal is to train neural networks with added noise in the margin region, located by structural information extracted from a planar graph. The so-called structural vectors, which are the training set vertices near the class boundary, are obtained from the structural information using Gabriel Graph. Synthetic samples are added to the learning set around the geometric vectors, improving generalization performance. A mathematical formulation that shows that the addition of synthetic samples has the same effect as the Tikhonov regularization is presented. Friedman and pos-hoc Nemenyi tests indicate that outcomes from the proposed method are statistically equivalent to the ones obtained by objective-function regularization, implying that both methods yield smoother solutions, reducing the effects of overfitting.

Keywords:

Training

Neurons

Licenses

Generative adversarial networks

Extreme learning machines

Data mining

Transmission line matrix methods

Classifier

neural network

regularization

training with noise

Neural Networks Regularization With Graph-Based Local Resampling

Abstract

AI Summary

Journal

Organization