DOCSLIB.ORG

Simultaneous Unsupervised and Supervised Learning of Cognitive

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Simultaneous Unsupervised and Supervised Learning of Cognitive Simultaneous unsupervised and supervised learning of cognitive functions in biologically plausible spiking neural networks Trevor Bekolay ([email protected]) Carter Kolbeck ([email protected]) Chris Eliasmith ([email protected]) Center for Theoretical Neuroscience, University of Waterloo 200 University Ave., Waterloo, ON N2L 3G1 Canada Abstract overcomes these limitations. Our approach 1) remains func- tional during online learning, 2) requires only two layers con- We present a novel learning rule for learning transformations of sophisticated neural representations in a biologically plau- nected with simultaneous supervised and unsupervised learn- sible manner. We show that the rule, which uses only infor- ing, and 3) employs spiking neuron models to reproduce cen- mation available locally to a synapse in a spiking network, tral features of biological learning, such as spike-timing de- can learn to transmit and bind semantic pointers. Semantic pointers have previously been used to build Spaun, which is pendent plasticity (STDP). currently the world’s largest functional brain model (Eliasmith et al., 2012). Two operations commonly performed by Spaun Online learning with spiking neuron models faces signifi- are semantic pointer binding and transmission. It has not yet been shown how the binding and transmission operations can cant challenges due to the temporal dynamics of spiking neu- be learned. The learning rule combines a previously proposed rons. Spike rates cannot be used directly, and must be esti- supervised learning rule and a novel spiking form of the BCM mated with causal filters, producing a noisy estimate. When unsupervised learning rule. We show that spiking BCM in- creases sparsity of connection weights at the cost of increased the signal being estimated changes, there is some time lag signal transmission error. We also demonstrate that the com- before the spiking activity reflects the new signal, resulting in bined learning rule can learn transformations as well as the situations during online learning in which the inputs and de- supervised rule and the offline optimization used previously. We also demonstrate that the combined learning rule is more sired outputs are out of sync. Our approach is robust to these robust to changes in parameters and leads to better outcomes sources of noise, while only depending on quantities that are in higher dimensional spaces, which is critical for explaining locally available to a synapse. cognitive performance on diverse tasks. Keywords: synaptic plasticity; spiking neural networks; unsu- Other techniques doing similar types of learning in spik- pervised learning; supervised learning; Semantic Pointer Ar- chitecture; Neural Engineering Framework. ing neural networks (e.g., SpikeProp [Bohte, Kok, & Poutre, 2002], ReSuMe [Ponulak, 2006]) can learn only simple op- In this paper, we demonstrate learning of cognitively rele- erations, such as learning to spike at a specific time. Oth- vant transformations of neural representations online and in ers (e.g., SORN [Lazar, Pipa, & Triesch, 2009], reservoir a biologically plausible manner. We improve upon a tech- computing approaches [Paugam-Moisy, Martinez, & Bengio, nique previously presented in MacNeil and Eliasmith (2011) 2008]) can solve complex tasks like classification, but it is not by combining their error-minimization learning rule with an clear how these approaches can be applied to a general cogni- unsupervised learning rule, making it more biologically plau- tive system. The functions learned by our approach are com- sible and robust. plex and have already been combined into a general cognitive There are three weaknesses with most previous attempts at system called the Semantic Pointer Architecture (SPA). Pre- combining supervised and unsupervised learning in artificial viously, the SPA has been used to create Spaun, a brain model neural networks (e.g., Backpropagation [Rumelhart, Hinton, made up of 2.5 million neurons that can do eight diverse tasks & Williams, 1986], Self-Organizing Maps [Kohonen, 1982], (Eliasmith et al., 2012). Spaun accomplishes these tasks by Deep Belief Networks [Hinton, Osindero, & Teh, 2006]). transmitting and manipulating semantic pointers, which are These approaches 1) have explicit offline training phases compressed neural representations that carry surface seman- that are distinct from functional use of the network, 2) re- tic content, and can be decompressed to generate deep se- quire many layers with some layers connected with super- mantic content (Eliasmith, in press). Semantic pointers are vised learning and others with unsupervised learning, and 3) composed to represent syntactic structure using a “binding” use non-spiking neuron models. The approach proposed here transformation, which compresses the information in two se- mantic pointers into a single semantic pointer. Such repre- BCM Bienenstock, Cooper, Munro learning rule; Eq (7) sentations can be “collected” using superposition, and col- hPES Homeostatic Prescribed Error Sensitivity; Eq (9) lections can participate in further bindings to generate deep NEF Neural Engineering Framework; see Theory structures. Spaun performs these transformations by using PES Prescribed Error Sensitivity; Eq (6) the Neural Engineering Framework (NEF; Eliasmith & An- SPA Semantic Pointer Architecture; see Theory derson, 2003) to directly compute static connection weights STDP Spike-timing dependent plasticity (Bi & Poo, 2001) between populations. We show that our approach can learn to transmit, bind, and classify semantic pointers. 169 Theory Transforming semantic pointers through connection Cognitive functions with spiking neurons weights The encoders and decoders used to represent se- mantic pointers also enable arbitrary transformations (i.e., In order to characterize cognitive functions at the level of mathematical functions) of encoded semantic pointers. If spiking neurons, we employ the methods of the Semantic population A encodes pointer X, and we want to connect it to Pointer Architecture (SPA), which was recently used to create population B, encoding pointer Y, a feedforward connection the world’s largest functional brain model (Spaun; Eliasmith with the following connection weights transmits that seman- et al., 2012), able to perform perceptual, motor, and cogni- tic pointer, such that Y ≈ X. tive functions. Cognitive functions in Spaun include work- ing memory, reinforcement learning, syntactic generalization, wi j = a je jdi; (5) and rule induction. The SPA is implemented using the principles of the Neu- where i indexes the presynaptic population A, and j indexes ral Engineering Framework (NEF; Eliasmith & Anderson, the postsynaptic population B. Other linear transformations 2003), which defines methods to 1) represent vectors of num- are implemented by multiplying di by a linear operator. Non- bers through the activity of populations of spiking neurons, 2) linear transformations are implemented by solving for a new transform those representations through the synaptic connec- set of decoding weights. This is done by minimizing the dif- tions between those populations, and 3) incorporate dynam- ference between the decoded estimate of f (x) and the actual ics through connecting populations recurrently. In the case f (x), rather than just x, in Equation (4). of learning, we exploit NEF representations in order to learn transformations analogous to those that can be found through Supervised learning: PES rule the NEF’s methods. MacNeil and Eliasmith (2011) proposed a learning rule that minimizes the error minimized in Equation (4) online. Representing semantic pointers in spiking neurons Rep- resentation in the NEF is similar to population coding, as pro- Ddi = kEai posed by Georgopoulos, Schwartz, and Kettner (1986), but Dw = ka e · Ea ; (6) extended to n-dimensional vector spaces. Each population of i j j j i neurons represents a point in an n-dimensional vector space where k is a scalar learning rate, E is a vector representing over time. Each neuron in that population is sensitive to a the error we wish to minimize, and other terms are as before. direction in the n-dimensional space, which we call the neu- When put in terms of connections weights (wi j), the rule ron’s encoder. The activity of a neuron can be expressed as resembles backpropagation. The quantity a je j · E is analo- gous to the local error term d in backpropagation (Rumelhart a = G[ae · x + J ]; (1) bias et al., 1986); they are both a means of translating a global where G[·] is the nonlinear neural activation function, a is error signal to a local error signal that can be used to change a scaling factor (gain) associated with the neuron, e is the an individual synaptic connection weight. The key difference between this rule and backpropagation is that the global-to- neuron’s encoder, x is the vector to be encoded, and Jbias is the background current of the cell. local mapping is done by imposing the portion of the error The vector (i.e., semantic pointer) that a population repre- vector space each neuron is sensitive to via its encoder. This sents can be estimated from the recent activity of the popu- limits flexibility, but removes the dependency on global infor- lation. The decoded estimate, xˆ, is the sum of the activity of mation, making the rule biologically plausible. We will refer each neuron, weighted by an n-dimensional decoder. to Equation (6) as the Prescribed Error Sensitivity (PES) rule. Unsupervised learning: Spiking BCM rule xˆ(t) = ∑diai(t); (2) i
Load more

Recommended publications
  • Arxiv:2107.04562V1 [Stat.ML] 9 Jul 2021 ¯ ¯ Θ∗ = Arg Min `(Θ) Where `(Θ) = `(Yi, Fθ(Xi)) + R(Θ)
    The Bayesian Learning Rule Mohammad Emtiyaz Khan H˚avard Rue RIKEN Center for AI Project CEMSE Division, KAUST Tokyo, Japan Thuwal, Saudi Arabia [email protected] [email protected] Abstract We show that many machine-learning algorithms are specific instances of a single algorithm called the Bayesian learning rule. The rule, derived from Bayesian principles, yields a wide-range of algorithms from fields such as optimization, deep learning, and graphical models. This includes classical algorithms such as ridge regression, Newton's method, and Kalman filter, as well as modern deep-learning algorithms such as stochastic-gradient descent, RMSprop, and Dropout. The key idea in deriving such algorithms is to approximate the posterior using candidate distributions estimated by using natural gradients. Different candidate distributions result in different algorithms and further approximations to natural gradients give rise to variants of those algorithms. Our work not only unifies, generalizes, and improves existing algorithms, but also helps us design new ones. 1 Introduction 1.1 Learning-algorithms Machine Learning (ML) methods have been extremely successful in solving many challenging problems in fields such as computer vision, natural-language processing and artificial intelligence (AI). The main idea is to formulate those problems as prediction problems, and learn a model on existing data to predict the future outcomes. For example, to design an AI agent that can recognize objects in an image, we D can collect a dataset with N images xi 2 R and object labels yi 2 f1; 2;:::;Kg, and learn a model P fθ(x) with parameters θ 2 R to predict the label for a new image.
    [Show full text]
  • Training Plastic Neural Networks with Backpropagation
    Differentiable plasticity: training plastic neural networks with backpropagation Thomas Miconi 1 Jeff Clune 1 Kenneth O. Stanley 1 Abstract examples. By contrast, biological agents exhibit a remark- How can we build agents that keep learning from able ability to learn quickly and efficiently from ongoing experience, quickly and efficiently, after their ini- experience: animals can learn to navigate and remember the tial training? Here we take inspiration from the location of (and quickest way to) food sources, discover and main mechanism of learning in biological brains: remember rewarding or aversive properties of novel objects synaptic plasticity, carefully tuned by evolution and situations, etc. – often from a single exposure. to produce efficient lifelong learning. We show Endowing artificial agents with lifelong learning abilities that plasticity, just like connection weights, can is essential to allowing them to master environments with be optimized by gradient descent in large (mil- changing or unpredictable features, or specific features that lions of parameters) recurrent networks with Heb- are unknowable at the time of training. For example, super- bian plastic connections. First, recurrent plastic vised learning in deep neural networks can allow a neural networks with more than two million parameters network to identify letters from a specific, fixed alphabet can be trained to memorize and reconstruct sets to which it was exposed during its training; however, au- of novel, high-dimensional (1,000+ pixels) nat- tonomous learning abilities would allow an agent to acquire ural images not seen during training. Crucially, knowledge of any alphabet, including alphabets that are traditional non-plastic recurrent networks fail to unknown to the human designer at the time of training.
    [Show full text]
  • The Neocognitron As a System for Handavritten Character Recognition: Limitations and Improvements
    The Neocognitron as a System for HandAvritten Character Recognition: Limitations and Improvements David R. Lovell A thesis submitted for the degree of Doctor of Philosophy Department of Electrical and Computer Engineering University of Queensland March 14, 1994 THEUliW^^ This document was prepared using T^X and WT^^. Figures were prepared using tgif which is copyright © 1992 William Chia-Wei Cheng (william(Dcs .UCLA. edu). Graphs were produced with gnuplot which is copyright © 1991 Thomas Williams and Colin Kelley. T^ is a trademark of the American Mathematical Society. Statement of Originality The work presented in this thesis is, to the best of my knowledge and belief, original, except as acknowledged in the text, and the material has not been subnaitted, either in whole or in part, for a degree at this or any other university. David R. Lovell, March 14, 1994 Abstract This thesis is about the neocognitron, a neural network that was proposed by Fuku- shima in 1979. Inspired by Hubel and Wiesel's serial model of processing in the visual cortex, the neocognitron was initially intended as a self-organizing model of vision, however, we are concerned with the supervised version of the network, put forward by Fukushima in 1983. Through "training with a teacher", Fukushima hoped to obtain a character recognition system that was tolerant of shifts and deformations in input images. Until now though, it has not been clear whether Fukushima's ap- proach has resulted in a network that can rival the performance of other recognition systems. In the first three chapters of this thesis, the biological basis, operational principles and mathematical implementation of the supervised neocognitron are presented in detail.
    [Show full text]
  • Connectionist Models of Cognition Michael S. C. Thomas and James L
    Connectionist models of cognition Michael S. C. Thomas and James L. McClelland 1 1. Introduction In this chapter, we review computer models of cognition that have focused on the use of neural networks. These architectures were inspired by research into how computation works in the brain and subsequent work has produced models of cognition with a distinctive flavor. Processing is characterized by patterns of activation across simple processing units connected together into complex networks. Knowledge is stored in the strength of the connections between units. It is for this reason that this approach to understanding cognition has gained the name of connectionism. 2. Background Over the last twenty years, connectionist modeling has formed an influential approach to the computational study of cognition. It is distinguished by its appeal to principles of neural computation to inspire the primitives that are included in its cognitive level models. Also known as artificial neural network (ANN) or parallel distributed processing (PDP) models, connectionism has been applied to a diverse range of cognitive abilities, including models of memory, attention, perception, action, language, concept formation, and reasoning (see, e.g., Houghton, 2005). While many of these models seek to capture adult function, connectionism places an emphasis on learning internal representations. This has led to an increasing focus on developmental phenomena and the origins of knowledge. Although, at its heart, connectionism comprises a set of computational formalisms,
    [Show full text]
  • Stochastic Gradient Descent Learning and the Backpropagation Algorithm
    Stochastic Gradient Descent Learning and the Backpropagation Algorithm Oliver K. Ernst Department of Physics University of California, San Diego La Jolla, CA 92093-0354 [email protected] Abstract Many learning rules minimize an error or energy function, both in supervised and unsupervised learning. We review common learning rules and their relation to gra- dient and stochastic gradient descent methods. Recent work generalizes the mean square error rule for supervised learning to an Ising-like energy function. For a specific set of parameters, the energy and error landscapes are compared, and con- vergence behavior is examined in the context of single linear neuron experiments. We discuss the physical interpretation of the energy function, and the limitations of this description. The backpropgation algorithm is modified to accommodate the energy function, and numerical simulations demonstrate that the learning rule captures the distribution of the network’s inputs. 1 Gradient and Stochastic Gradient Descent A learning rule is an algorithm for updating the weights of a network in order to achieve a particular goal. One particular common goal is to minimize a error function associated with the network, also referred to as an objective or cost function. Let Q(w) denote the error function associated with a network with connection weights w. A first approach to minimize the error is the method of gradient descent, where at each iteration a step is taken in the direction corresponding to Q(w). The learning rule that follows is −∇ w := w η Q(w); (1) − r where η is a constant parameter called the learning rate. Consider being given a set of n observations xi; ti , where i = 1; 2:::n.
    [Show full text]
  • The Hebbian-LMS Learning Algorithm
    Michael Margaliot TheTel Aviv University, Hebbian-LMS Israel Learning Algorithm ©ISTOCKPHOTO.COM/BESTDESIGNS Bernard Widrow, Youngsik Kim, and Dookun Park Abstract—Hebbian learning is widely accepted in the fields of psychology, neurology, and neurobiol- Department of Electrical Engineering, ogy. It is one of the fundamental premises of neuro- Stanford University, CA, USA science. The LMS (least mean square) algorithm of Widrow and Hoff is the world’s most widely used adaptive algorithm, fundamental in the fields of signal processing, control systems, pattern recognition, and arti- I. Introduction ficial neural networks. These are very different learning onald O. Hebb has had considerable influence paradigms. Hebbian learning is unsupervised. LMS learn- in the fields of psychology and neurobiology ing is supervised. However, a form of LMS can be con- since the publication of his book “The structed to perform unsupervised learning and, as such, LMS can be used in a natural way to implement Hebbian learn- Organization of Behavior” in 1949 [1]. Heb- ing. Combining the two paradigms creates a new unsuper- Dbian learning is often described as: “neurons that fire vised learning algorithm that has practical engineering together wire together.” Now imagine a large network of applications and provides insight into learning in living interconnected neurons whose synaptic weights are neural networks. A fundamental question is, how does increased because the presynaptic neuron and the postsynap- learning take place in living neural networks? “Nature’s little secret,” the learning algorithm practiced by tic neuron fired together. This might seem strange. What nature at the neuron and synapse level, may well be purpose would nature fulfill with such a learning algorithm? the Hebbian-LMS algorithm.
    [Show full text]
  • Artificial Neural Networks Supplement to 2001 Bioinformatics Lecture on Neural Nets
    Artificial Neural Networks Supplement to 2001 Bioinformatics Lecture on Neural Nets ಲং ྼႨ E-mail: [email protected] http://scai.snu.ac.kr./~btzhang/ Byoung-Tak Zhang School of Computer Science and Engineering SeoulNationalUniversity Outline 1. Basic Concepts of Neural Networks 2. Simple Perceptron and Delta Rule 3. Multilayer Perceptron and Backpropagation Learning 4. Applications of Neural Networks 5. Summary and Further Information 2 1. Basic Concepts of Neural Networks The Brain vs. Computer 1. 1011 neurons with 1. A single processor with 1014 synapses complex circuits 2. Speed: 10-3 sec 2. Speed: 10 –9 sec 3. Distributed processing 3. Central processing 4. Nonlinear processing 4. Arithmetic operation (linearity) 5. Parallel processing 5. Sequential processing 4 What Is a Neural Network? ! A new form of computing, inspired by biological (brain) models. ! A mathematical model composed of a large number of simple, highly interconnected processing elements. ! A computational model for studying learning and intelligence. 5 From Biological Neuron to Artificial Neuron 6 From Biology to Artificial Neural Networks (ANNs) 7 Properties of Artificial Neural Networks ! A network of artificial neurons ! Characteristics " Nonlinear I/O mapping " Adaptivity " Generalization ability " Fault-tolerance (graceful degradation) " Biological analogy <Multilayer Perceptron Network> 8 Synonyms for Neural Networks ! Neurocomputing ! Neuroinformatics (Neuroinformatik) ! Neural Information Processing Systems ! Connectionist Models ! Parallel Distributed Processing (PDP) Models ! Self-organizing Systems ! Neuromorphic Systems 9 Brief History ! William James (1890): Describes (in words and figures) simple distributed networks and Hebbian Learning ! McCulloch & Pitts (1943): Binary threshold units that perform logical operations (they prove universal computations!) ! Hebb (1949): Formulation of a physiological (local) learning rule ! Rosenblatt (1958): The Perceptron - a first real learning machine ! Widrow & Hoff (1960): ADALINE and the Windrow-Hoff supervised learning rule.
    [Show full text]
  • A Unified Framework of Online Learning Algorithms for Training
    Journal of Machine Learning Research 21 (2020) 1-34 Submitted 7/19; Revised 3/20; Published 6/20 A Unified Framework of Online Learning Algorithms for Training Recurrent Neural Networks Owen Marschall [email protected] Center for Neural Science New York University New York, NY 10003, USA Kyunghyun Cho∗ [email protected] New York University CIFAR Azrieli Global Scholar Cristina Savin [email protected] Center for Neural Science Center for Data Science New York University Editor: Yoshua Bengio Abstract We present a framework for compactly summarizing many recent results in efficient and/or biologically plausible online training of recurrent neural networks (RNN). The framework organizes algorithms according to several criteria: (a) past vs. future facing, (b) tensor structure, (c) stochastic vs. deterministic, and (d) closed form vs. numerical. These axes reveal latent conceptual connections among several recent advances in online learning. Furthermore, we provide novel mathematical intuitions for their degree of success. Testing these algorithms on two parametric task families shows that performances cluster according to our criteria. Although a similar clustering is also observed for pairwise gradient align- ment, alignment with exact methods does not explain ultimate performance. This suggests the need for better comparison metrics. Keywords: real-time recurrent learning, backpropagation through time, approximation, biologically plausible learning, local, online 1. Introduction Training recurrent neural networks (RNN) to learn sequence data is traditionally done with stochastic gradient descent (SGD), using the backpropagation through time algorithm (BPTT, Werbos et al., 1990) to calculate the gradient. This requires \unrolling" the network over some range of time steps T and performing backpropagation as though the network were feedforward under the constraint of sharing parameters across time steps (\layers").
    [Show full text]
  • Big Idea #3: Learning Key Insights Explanation
    Draft Big Idea 3 - Progression Chart www.AI4K12.org Big Idea #3: Learning Key Insights Explanation Machine learning allows a computer to acquire behaviors without people explicitly Definition of "machine learning" programming those behaviors. Learning new behaviors results from changes the learning algorithm makes to the How machine learning algorithms work internal representations of a reasoning model, such as a decision tree or a neural network. Large amounts of training data are required to narrow down the learning algorithm's The role of training data choices when the reasoning model is capable of a great variety of behaviors. The reasoning model constructed by the machine learning algorithm can be applied to Learning phase vs. application phase new data to solve problems or make decisions. V.0.1 - Released November 19, 2020 Subject to change based on public feedback 1 Draft Big Idea 3 - Progression Chart www.AI4K12.org Big Idea #3: LO = Learning Objective: EU = Enduring Understanding: Unpacked descriptions are included when necessary to Learning Computers can learn from data. What students should be able to do. What students should know. illustrate the LO or EU Concept K-2 3-5 6-8 9-12 Nature of Learning LO: Describe and provide examples of how people learn LO: Differentiate between how people learn and how LO: Contrast the unique characteristics of human LO: Define supervised, unsupervised, and reinforcement (Humans vs. machines) and how computers learn. computers learn. learning with the ways machine learning systems learning algorithms, and give examples of human operate. learning that are similar to each algorithm. 3-A-i EU: Computers learn differently than people.
    [Show full text]
  • Using Reinforcement Learning to Learn How to Play Text-Based Games
    MASTER THESIS Bc. Mikul´aˇsZelinka Using reinforcement learning to learn how to play text-based games Department of Theoretical Computer Science and Mathematical Logic arXiv:1801.01999v1 [cs.CL] 6 Jan 2018 Supervisor of the master thesis: Mgr. Rudolf Kadlec, Ph.D. Study programme: Informatics Study branch: Artificial Intelligence Prague 2017 I declare that I carried out this master thesis independently, and only with the cited sources, literature and other professional sources. I understand that my work relates to the rights and obligations under the Act No. 121/2000 Sb., the Copyright Act, as amended, in particular the fact that the Charles University has the right to conclude a license agreement on the use of this work as a school work pursuant to Section 60 subsection 1 of the Copyright Act. In ........ date ............ signature of the author i Title: Using reinforcement learning to learn how to play text-based games Author: Bc. Mikul´aˇsZelinka Department: Department of Theoretical Computer Science and Mathematical Logic Supervisor: Mgr. Rudolf Kadlec, Ph.D., Department of Theoretical Computer Science and Mathematical Logic Abstract: The ability to learn optimal control policies in systems where action space is defined by sentences in natural language would allow many interesting real-world applications such as automatic optimisation of dialogue systems. Text- based games with multiple endings and rewards are a promising platform for this task, since their feedback allows us to employ reinforcement learning techniques to jointly learn text representations and control policies. We present a general text game playing agent, testing its generalisation and transfer learning performance and showing its ability to play multiple games at once.
    [Show full text]
  • Comparison of Supervised and Unsupervised Learning Algorithms for Pattern Classification
    (IJARAI) International Journal of Advanced Research in Artificial Intelligence, Vol. 2, No. 2, 2013 Comparison of Supervised and Unsupervised Learning Algorithms for Pattern Classification R. Sathya Annamma Abraham Professor, Dept. of MCA, Professor and Head, Dept. of Mathematics Jyoti Nivas College (Autonomous), Professor and Head, B.M.S.Institute of Technology, Dept. of Mathematics, Bangalore, India. Bangalore, India. Abstract: This paper presents a comparative account of Section III introduces classification and its requirements in unsupervised and supervised learning models and their pattern applications and discusses the familiarity distinction between classification evaluations as applied to the higher education supervised and unsupervised learning on the pattern-class scenario. Classification plays a vital role in machine based information. Also, we lay foundation for the construction of learning algorithms and in the present study, we found that, classification network for education problem of our interest. though the error back-propagation learning algorithm as Experimental setup and its outcome of the current study are provided by supervised learning model is very efficient for a presented in Section IV. In Section V we discuss the end number of non-linear real-time problems, KSOM of results of these two algorithms of the study from different unsupervised learning model, offers efficient solution and perspective. Section VI concludes with some final thoughts on classification in the present study. supervised and unsupervised learning algorithm for Keywords – Classification; Clustering; Learning; MLP; SOM; educational classification problem. Supervised learning; Unsupervised learning; II. ANN LEARNING PARADIGMS I. INTRODUCTION Learning can refer to either acquiring or enhancing Introduction of cognitive reasoning into a conventional knowledge.
    [Show full text]
  • Recent Advances in the Deep CNN Neocognitron
    NOLTA, IEICE Invited Paper Recent advances in the deep CNN neocognitron Kunihiko Fukushima 1 a) 1 Fuzzy Logic Systems Institute 680-41 Kawazu, Iizuka, Fukuoka 820-0067, Japan a) [email protected] Received October 19, 2018; Published October 1, 2019 Abstract: Deep convolutional neural networks (deep CNN) show a large power for robust recognition of visual patterns. The neocognitron, which was first proposed by Fukushima (1979), is a network classified to this category. Its architecture was suggested by neurophysi- ological findings on the visual systems of mammals. It acquires the ability to recognize visual patterns robustly through learning. Although the neocognitron has a long history, improve- ments of the network are still continuing. This paper discusses the recent neocognitron, focusing on differences from the conventional deep CNN. Some other functions of the visual system can also be realized by networks extended from the neocognitron, for example, recognition of partly occluded patterns, the mechanism of selective attention, and so on. Key Words: deep CNN, pattern recognition, neocognitron, add-if-silent rule, interpolating- vector 1. Introduction Recently, deep convolutional neural networks (deep CNN) have become very popular in the field of visual pattern recognition (e.g. [1]). The neocognitron, which was first proposed by Fukushima [2–4], is a network classified to this category. It is a hierarchical multi-layered network. Its architecture was suggested by neurophysiological findings on the visual systems of mammals. It acquires the ability to recognize visual patterns robustly through learning. Although the neocognitron has a long history, improvements of the network are still continuing. For training intermediate layers of the neocognitron, the learning rule called AiS (Add-if-Silent) is used.
    [Show full text]