An Algorithm for the Construction of Improved Training Sets for Neural Networks

In this paper we represent a novel approach for improving the training process of an arbitrary backprop-based (e.g. convolution) neural networks, in terms of accuracy and speed. The gain in the performance is due to the alternative method of selection of the samples, to be included in the training set. In the presented Entropy Maximal (EntMax) approach, the samples having higher relative entropy are to be selected to comprise the training set. The images of handwritten characters are considered as discrete random independent and identically distributed (i.i.d.) variables. By applying this approach one takes advantage not only by improving the prediction ability of the neural network, over the validation set, but also by decreasing the time necessary for training, due to the lower number of samples, necessary to provide satisfactory classification ability and the lower number of epochs, needed to assure satisfactory level of the error rate.

Authors

Institutions

Publication Details

Published
2024-08-29
DOI
https://doi.org/10.1109/is61756.2024.10705266
Primary Topic
Advanced Data Processing Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Algorithm for the Construction of Improved Training Sets for Neural Networks

Kalin Stoyanov
Advanced Data Processing Techniques
article

An Algorithm for the Construction of Improved Training Sets for Neural Networks

Kalin Stoyanov
article en

Abstract

In this paper we represent a novel approach for improving the training process of an arbitrary backprop-based (e.g. convolution) neural networks, in terms of accuracy and speed. The gain in the performance is due to the alternative method of selection of the samples, to be included in the training set. In the presented Entropy Maximal (EntMax) approach, the samples having higher relative entropy are to be selected to comprise the training set. The images of handwritten characters are considered as discrete random independent and identically distributed (i.i.d.) variables. By applying this approach one takes advantage not only by improving the prediction ability of the neural network, over the validation set, but also by decreasing the time necessary for training, due to the lower number of samples, necessary to provide satisfactory classification ability and the lower number of epochs, needed to assure satisfactory level of the error rate.

University of Chemical Technology and Metallurgy (BG)
Openalex Percentile: Top 80%
Advanced Data Processing Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.