Reduction of Visual Information in Neural Network Learning Process Visualization

Author(s):  
Matus Uzak ◽  
Igor Vertal' ◽  
Rudolf Jaksa ◽  
Peter Sincak
Telecom IT ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 92-108
Author(s):  
I. Zelichenok ◽  
R. Pirmagomedov

This article provides a tutorial for developing a simple machine learning application in Python. More spe-cifically, the paper considers daily activity recognition using sensors of a smartphone. For development, we used TensorFlow, Skikit learn, NumPy, Pandas, and Matplotlib. The paper explains in detail the main steps of the application development, including data collection and pre-processing, design of the neural network, learning process, and use of a trained model. The overall accuracy of the developed application when recognizing the activity is about 95 %. This paper can be useful for students and specialists who want to start work on machine learning.


2011 ◽  
Vol 131 (11) ◽  
pp. 1889-1894
Author(s):  
Yuta Tsuchida ◽  
Michifumi Yoshioka

Entropy ◽  
2021 ◽  
Vol 23 (6) ◽  
pp. 711
Author(s):  
Mina Basirat ◽  
Bernhard C. Geiger ◽  
Peter M. Roth

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.


1994 ◽  
Vol 04 (01) ◽  
pp. 23-51 ◽  
Author(s):  
JEROEN DEHAENE ◽  
JOOS VANDEWALLE

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