Hybridization of Metaheuristic and Population-Based Algorithms with Neural Network Learning for Function Approximation

2021 ◽  
pp. 45-56
Author(s):  
Zhen-Yao Chen
Keyword(s):  
Neural Network ◽  
Function Approximation ◽  
Population Based ◽  
Neural Network Learning ◽  
Network Learning

scholarly journals Kernel-blending connection approximated by a neural network for image classification

2020 ◽  
Vol 6 (4) ◽  
pp. 467-476
Author(s):  
Xinxin Liu ◽  
Yunfeng Zhang ◽  
Fangxun Bao ◽  
Kai Shao ◽  
Ziyi Sun ◽  
...  
Keyword(s):  
Neural Network ◽  
Image Classification ◽  
Function Approximation ◽  
Feature Space ◽  
Neural Network Learning ◽  
Network Learning ◽  
Hinge Loss ◽  
The Neural Network ◽  
Good Classification ◽  
Kernel Mapping

AbstractThis paper proposes a kernel-blending connection approximated by a neural network (KBNN) for image classification. A kernel mapping connection structure, guaranteed by the function approximation theorem, is devised to blend feature extraction and feature classification through neural network learning. First, a feature extractor learns features from the raw images. Next, an automatically constructed kernel mapping connection maps the feature vectors into a feature space. Finally, a linear classifier is used as an output layer of the neural network to provide classification results. Furthermore, a novel loss function involving a cross-entropy loss and a hinge loss is proposed to improve the generalizability of the neural network. Experimental results on three well-known image datasets illustrate that the proposed method has good classification accuracy and generalizability.

Speed up Neural Network Learning by GPGPU

2011 ◽  
Vol 131 (11) ◽  
pp. 1889-1894
Author(s):  
Yuta Tsuchida ◽  
Michifumi Yoshioka
Keyword(s):  
Neural Network ◽  
Neural Network Learning ◽  
Network Learning ◽  
Speed Up

scholarly journals A Geometric Perspective on Information Plane Analysis

Entropy ◽  
2021 ◽  
Vol 23 (6) ◽  
pp. 711
Author(s):  
Mina Basirat ◽  
Bernhard C. Geiger ◽  
Peter M. Roth
Keyword(s):  
Neural Network ◽  
Mutual Information ◽  
Geometric Interpretation ◽  
Neural Network Training ◽  
Neural Network Learning ◽  
Network Learning ◽  
Plane Analysis ◽  
Network Training ◽  
Hidden Layer ◽  
The Impact

Information plane analysis, describing the mutual information between the input and a hidden layer and between a hidden layer and the target over time, has recently been proposed to analyze the training of neural networks. Since the activations of a hidden layer are typically continuous-valued, this mutual information cannot be computed analytically and must thus be estimated, resulting in apparently inconsistent or even contradicting results in the literature. The goal of this paper is to demonstrate how information plane analysis can still be a valuable tool for analyzing neural network training. To this end, we complement the prevailing binning estimator for mutual information with a geometric interpretation. With this geometric interpretation in mind, we evaluate the impact of regularization and interpret phenomena such as underfitting and overfitting. In addition, we investigate neural network learning in the presence of noisy data and noisy labels.

LOCALLY IMPLEMENTABLE MATRIX FLOWS AND THEIR APPLICATION TO NEURAL NETWORK LEARNING

1994 ◽  
Vol 04 (01) ◽  
pp. 23-51 ◽  
Author(s):  
JEROEN DEHAENE ◽  
JOOS VANDEWALLE
Keyword(s):  
Neural Network ◽  
Signal Processing ◽  
Network Structure ◽  
Adaptive Signal Processing ◽  
External Signal ◽  
Neural Network Learning ◽  
Network Learning ◽  
Adaptive Signal

A number of matrix flows, based on isospectral and isodirectional flows, is studied and modified for the purpose of local implementability on a network structure. The flows converge to matrices with a predefined spectrum and eigenvectors which are determined by an external signal. The flows can be useful for adaptive signal processing applications and are applied to neural network learning.

Sign in / Sign up

Export Citation Format

Share Document