A Novel Deep Learning ANN Supported on Langevin-Neelakanta Machine
DOI:
https://doi.org/10.14738/tmlai.104.13100Keywords:
Deep learning, Machine learning, Artificial Intelligence, Artificial neural network, Logistic learning, Langevin-Neelakanta machineAbstract
In the contexts of deep learning (DL) considered in artificial intelligence (AI) efforts, relevant machine learning (ML) algorithms adopted refer to using a class of deep artificial neural network (ANN) that supports a learning process exercised with an enormous set of input data (labeled and/or unlabeled) so to predict at the output details on accurate features of labeled data present in the input data set. In the present study, a deep ANN is proposed thereof conceived with certain novel considerations: The proposed deep architecture consists of a large number of consequently placed structures of paired-layers. Each layer hosts identical number of neuronal units for computation and the neuronal units are massively interconnected across the entire network. Further, each paired-layer is independently subjected to unsupervised learning (USL). Hence, commencing from the input layer-pair, the excitatory (input) data supplied flows across the interconnected neurons of paired layers, terminating eventually at the final pair of layers, where the output is recovered. That is, the converged neuronal states at any given pair is iteratively passed on to the next pair and so on. The USL suite involves collectively gathering the details of neural information across a pair of the layers constituting the network. This summed data is then limited with a specific choice of a squashing (sigmoidal) function; and, the resulting scaled value is used to adjust the coefficients of interconnection weights seeking a convergence criterion. The associated learning rate on weight adjustment is uniquely designed to facilitate fast learning towards convergence. The unique aspects of deep learning proposed here refer to: (i) Deducing the learning coefficient with a compatible algorithm so as to realize a fast convergence; and, (ii) the adopted sigmoidal function in the USL loop conforms to the heuristics of the so-called Langevin-Neelakanta machine. The paper describes the proposed deep ANN architecture with necessary details on structural considerations, sigmoidal selection, prescribing required learning rate and operational (training and predictive phase) routines. Results are furnished to demonstrate the performance efficacy of the test ANN.
References
Neelakanta, P. S., De Groff, D., Neural Network Modeling: Statistical Mechanics and Cybernetic Perspectives, 1994, CRC Press, Boca Raton, Fl: USA.
Neelakanta, P. S., (Editor), Information-Theoretic Aspects of Neural Networks, 1999, CRC Press, Boca Raton, Fl: USA.
Neelakanta, P. S., Sudhakar, R., and DeGroff, D., Langevin machine: A neural network based on stochastically justifiable sigmoidal function, Biological Cybernetics, 1999, 65, p. 331-338.
Fukushima, K. Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position. Biological Cybernetics, 1980, 36, p.193-202.
Fukushima, K. Cognitron: A self-organizing multilayered neural network. Biological Cybernetics, 1975, 20, p.121-136.
Becker, S., Plumbley, M. Unsupervised neural network learning unsupervised neural network learning procedures for feature extraction and classification. Applied Intelligence, 1996, 6, p.185-203.
Wittek, P., Unsupervised learning in quantum machine learning, Elsevier Inc/Morgan Kaufmann, 2014, Cambridge, MA: USA.
De Groff, D., Neelakanta, P. S., Faster convergent neural networks, International Journal of Computers and Technology, 2018, 17(1), p.7126-7132.
Margoulas, G. D., Vrahatis, M. N., Androulakis, G.S. Improving the convergence of the backpropagation algorithm using learning rate adaptation methods, Neural Computation, 1999, 11(7), p. 1769-1796.
Schmidhuber, J. Discovering neural nets with low Kolmogorov complexity and high generalization capability. Neural Network, 1997, 10(5), p.857-873
Balcázar, J. L. Computational power of neural networks: A characterization in terms of Kolmogorov complexity. IEEE Transactions on Information Theory, 1997, 43(4), p.1175-1183.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2022 Dolores De Groff, Perambur S. Neelakanta

This work is licensed under a Creative Commons Attribution 4.0 International License.