DOCSLIB.ORG

Wide Hidden Expansion Layer for Deep Convolutional Neural Networks

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Wide Hidden Expansion Layer for Deep Convolutional Neural Networks Wide Hidden Expansion Layer for Deep Convolutional Neural Networks Min Wang Baoyuan Liu Hassan Foroosh University of Central Florida Amazon University of Central Florida [email protected] [email protected] [email protected] Abstract the networks by massively increasing the number of activa- tion functions with a novel Wide Hidden Expansion (WHE) Non-linearity is an essential factor contributing to the layer, which can be flexibly embedded into different net- success of deep convolutional neural networks. Increasing work architectures via appending to convolutional layers. the non-linearity in the network will enhance the network’s In the WHE layer, while the number of output channels learning capability, attributing to better performance. We remains the same as that of input channels, there implic- present a novel Wide Hidden Expansion (WHE) layer that itly exists a large number of hidden channels connecting can significantly increase (by an order of magnitude ) the the input and the output. Each hidden channel is followed number of activation functions in the network, with very lit- by one activation function. Therefore, the number of acti- tle increase of computational complexity and memory con- vation functions can grow along with that of hidden chan- sumption. It can be flexibly embedded with different net- nels. Each hidden channel passes the weighted sum of two work architectures to boost the performance of the original input channels through an activation function and then ag- networks. The WHE layer is composed of a wide hidden gregates the result to one output channel. Such structured layer, in which each channel only connects with two in- sparse connectivity guarantees that the computational com- put channels and one output channel. Before connecting to plexity of this layer is bound to be a fraction of the tradi- the output channel, each intermediate channel in the WHE tional convolutional layer. On the other hand, hidden chan- layer is followed by one activation function. In this manner, nels merely exist temporarily in the GPU cache during both the number of activation functions can grow along with the the forward and backward phase of the layer. Therefore, number of channels in the hidden layer. We apply the WHE the memory consumption (both training and inference) of layer to ResNet, WideResNet, SENet, and MobileNet archi- WHE is aligned with the size of the input tensor rather than tectures and evaluate on ImageNet, CIFAR-100, and Tiny that of hidden channels. ImageNet dataset. On the ImageNet dataset, models with The merit of the proposed WHE layer is straightforward: the WHE layer can achieve up to 2.01% higher Top-1 accu- we can increase the number of channels as well as the num- racy than baseline models, with less than 4% computation ber of activation functions by more than an order of mag- increase and less than 2% more parameters. On CIFAR- nitude, with minimal increase of consumed resources (both 100 and Tiny ImageNet, when applying the WHE layer to computation and memory). Hidden channels here cannot be ResNet models, it demonstrates consistent improvement in considered equivalent to the channels in the traditional con- the accuracy of the networks. Applying the WHE layer to volutional layer since they are very sparsely connected to ResNet backbone of the CenterNet object detection model the much narrower input and output. However, they do in- can also boost its performance on COCO and Pascal VOC troduce substantial activation functions, which provide the datasets. non-linearity that is essential for a deep network to learn the complex distribution of visual data. 1. Introduction Comparing to methods that utilize channel-wise “bottle- neck” structure like ResNet [10] and ResNeXt [31], the fun- In convolutional neural networks, the convolutional lay- damental difference between the WHE layer and them is the ers perform linear transformations to the feature space, structured sparse connections in WHE. Because each hid- while the activation function layers provide non-linear den channel in WHE is only connected to two input chan- warping to the feature space. Both linear transformation nels and one output channel, a substantial increase in hidden and non-linear warping are essential to the network’s capa- channels requires only minor extra computation. While in bility of learning complex distribution. ResNeXt, each hidden channel is connected to all the input In this work, we propose to increase the non-linearity in and output channels in the same group. With the same con- 934 figuration on the input, hidden, and output channels, a mod- Novel layer designs ule that is built with the “bottleneck” and grouping struc- While most of the state-of-the-art deep architectures are ture as in ResNeXt consumes more than 10 times computa- designed by reconfiguring existing layers, in recent years, tion than WHE. Additionally, the structured sparse connec- there is some research focusing on proposing new layers, tion in WHE makes it possible for the hidden channels to to which this work also belongs. Several new types of ac- be computed on-the-fly and never stored on the main GPU tivation functions [3, 5, 9, 16, 28] have been proposed to memory, which is difficult to be achieved by ResNeXt. replace the original ReLU function. In NIN [20], a micro We evaluate our WHE layer on the ImageNet classifica- multiple layer perceptron network is used to scan the in- tion dataset, CIFAR-100, and Tiny ImageNet datasets with put feature map to extract better representation. In SICNet various network architectures. It demonstrates that when [27] and MobileNet[12], the expensive convolutional layer adding the WHE layer to existing network architectures, is replaced with a combination of a novel 2D intra-channel our method can consistently achieve significant improve- convolution and 1 × 1 convolutional layer, achieving simi- ment with a marginal increase of computation and param- lar representative power with much lower complexity. CN- eters. We also show that applying WHE to the backbone NPack [29] performs the convolution in the frequency do- of the object detection network can boost performance on main with Discrete Cosine Transform (DCT), and achieves different datasets. high compression by discarding low-energy frequency co- The rest of this paper is structured as follows. In sec- efficients. In LBCNN [17], the pre-defined sparse binary tion 3, we introduce the mechanism of the proposed WHE 2D kernels are convolved with the input, and then linearly layer, analyze its computational complexity and memory combined to replace the traditional convolutional layers. consumption, and discuss the implementation details; In section 4, we explain the evaluation of our method, and dis- Activation functions cuss the experimental result; Section 5 concludes the paper. The predominant approach for a higher non-linearity in the network is to design more powerful activation functions. 2. Related Work The most extensively used activation function is Rectified Linear Unit (ReLu) due to its fast convergence. In ReLU, Deep Architectures the non-linearity comes only at the linear path’s change at the origin. Several ReLU variants are proposed to increase AlexNet [19] is the first deep CNN architecture applied the non-linearity of the networks. PReLU [9] introduces to large scale image classification problems. ZFNet [35] learnable parameters for the slope of the negative linear part adjusts the kernel and stride size of the first convolutional to increase the diversity of the activation function. ELU [5] layer in AlexNet to achieve better accuracy. VGGNet [24] proposes to use the exponential curve for the negative part uses 3 × 3 convolutional layer exclusively, which is very and makes the activation function differentiable at every lo- deep and computational expensive at that time but shows cation. LuTU [28] proposes to learn the shape of activa- the power of depth in network design. GoogleNet [26], in tion function with a look-up table structure and observes contrast, takes a very different approach. While having sim- the peak and valley patterns widely existing in the shapes ilar depth to VGGNet, its architecture is much more com- of the learned activation function, which can be replaced by plex and diverse, achieving similar accuracy with much less Gaussian mixture models. theoretical computation. Batch Normalization [15] makes Sparse connections it possible to train a deep network without vanishing or ex- ploding gradients. In ResNet [10], the residual connection The layer proposed in this work can be considered as a reduces the length of the back- propagation path and enables hidden one, with structured sparse connections with the in- effective training of network with more than one hundred put/output layers. Sparsity in convolutional neural networks layers. ResNeXt [31] improves the “cardinality” of the net- has been widely studied in recent years. In SCNN [22], the work with group convolutions. In [34], extremely wide net- convolutional kernel is decomposed along both the spatial works are evaluated against deep architectures. The authors dimensions and the channel dimension to exploit its redun- show that width can be as effective as depth regarding im- dancy and then sparsified by training with l1 penalty. In proving network performance. DenseNet [14] inserts resid- [8], the weights in the kernel are pruned, quantized, and ual connections between each pair of convolutional layers encoded with Huffman coding to achieve high compres- to improve feature propagation and reuse. In SENet [13], a sion. In [30], structured sparsity of the convolutional ker- squeeze-and-excitation block is introduced to aggregate the nel is learned with group Lasso regularization over the fil- spatial information in each channel. In NASNet [37], an ter and channel dimensions. [11] introduces sparsity along optimized convolutional architecture is learned on a small the channel dimension by imposing Lasso regression on the dataset and then applied to large scale datasets.
Load more

Recommended publications
  • Face Recognition: a Convolutional Neural-Network Approach
    98 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 8, NO. 1, JANUARY 1997 Face Recognition: A Convolutional Neural-Network Approach Steve Lawrence, Member, IEEE, C. Lee Giles, Senior Member, IEEE, Ah Chung Tsoi, Senior Member, IEEE, and Andrew D. Back, Member, IEEE Abstract— Faces represent complex multidimensional mean- include fingerprints [4], speech [7], signature dynamics [36], ingful visual stimuli and developing a computational model for and face recognition [8]. Sales of identity verification products face recognition is difficult. We present a hybrid neural-network exceed $100 million [29]. Face recognition has the benefit of solution which compares favorably with other methods. The system combines local image sampling, a self-organizing map being a passive, nonintrusive system for verifying personal (SOM) neural network, and a convolutional neural network. identity. The techniques used in the best face recognition The SOM provides a quantization of the image samples into a systems may depend on the application of the system. We topological space where inputs that are nearby in the original can identify at least two broad categories of face recognition space are also nearby in the output space, thereby providing systems. dimensionality reduction and invariance to minor changes in the image sample, and the convolutional neural network provides for 1) We want to find a person within a large database of partial invariance to translation, rotation, scale, and deformation. faces (e.g., in a police database). These systems typically The convolutional network extracts successively larger features return a list of the most likely people in the database in a hierarchical set of layers. We present results using the [34].
    [Show full text]
  • CNN Architectures
    Lecture 9: CNN Architectures Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 9 - 1 May 2, 2017 Administrative A2 due Thu May 4 Midterm: In-class Tue May 9. Covers material through Thu May 4 lecture. Poster session: Tue June 6, 12-3pm Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 9 - 2 May 2, 2017 Last time: Deep learning frameworks Paddle (Baidu) Caffe Caffe2 (UC Berkeley) (Facebook) CNTK (Microsoft) Torch PyTorch (NYU / Facebook) (Facebook) MXNet (Amazon) Developed by U Washington, CMU, MIT, Hong Kong U, etc but main framework of Theano TensorFlow choice at AWS (U Montreal) (Google) And others... Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 9 - 3 May 2, 2017 Last time: Deep learning frameworks (1) Easily build big computational graphs (2) Easily compute gradients in computational graphs (3) Run it all efficiently on GPU (wrap cuDNN, cuBLAS, etc) Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 9 - 4 May 2, 2017 Last time: Deep learning frameworks Modularized layers that define forward and backward pass Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 9 - 5 May 2, 2017 Last time: Deep learning frameworks Define model architecture as a sequence of layers Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 9 - 6 May 2, 2017 Today: CNN Architectures Case Studies - AlexNet - VGG - GoogLeNet - ResNet Also.... - NiN (Network in Network) - DenseNet - Wide ResNet - FractalNet - ResNeXT - SqueezeNet - Stochastic Depth Fei-Fei Li & Justin Johnson & Serena Yeung Lecture 9 - 7 May 2, 2017 Review: LeNet-5 [LeCun et al., 1998] Conv filters were 5x5, applied at stride 1 Subsampling (Pooling) layers were 2x2 applied at stride 2 i.e.
    [Show full text]
  • Deep Learning Architectures for Sequence Processing
    Speech and Language Processing. Daniel Jurafsky & James H. Martin. Copyright © 2021. All rights reserved. Draft of September 21, 2021. CHAPTER Deep Learning Architectures 9 for Sequence Processing Time will explain. Jane Austen, Persuasion Language is an inherently temporal phenomenon. Spoken language is a sequence of acoustic events over time, and we comprehend and produce both spoken and written language as a continuous input stream. The temporal nature of language is reflected in the metaphors we use; we talk of the flow of conversations, news feeds, and twitter streams, all of which emphasize that language is a sequence that unfolds in time. This temporal nature is reflected in some of the algorithms we use to process lan- guage. For example, the Viterbi algorithm applied to HMM part-of-speech tagging, proceeds through the input a word at a time, carrying forward information gleaned along the way. Yet other machine learning approaches, like those we’ve studied for sentiment analysis or other text classification tasks don’t have this temporal nature – they assume simultaneous access to all aspects of their input. The feedforward networks of Chapter 7 also assumed simultaneous access, al- though they also had a simple model for time. Recall that we applied feedforward networks to language modeling by having them look only at a fixed-size window of words, and then sliding this window over the input, making independent predictions along the way. Fig. 9.1, reproduced from Chapter 7, shows a neural language model with window size 3 predicting what word follows the input for all the. Subsequent words are predicted by sliding the window forward a word at a time.
    [Show full text]
  • Introduction-To-Deep-Learning.Pdf
    Introduction to Deep Learning Demystifying Neural Networks Agenda Introduction to deep learning: • What is deep learning? • Speaking deep learning: network types, development frameworks and network models • Deep learning development flow • Application spaces Deep learning introduction ARTIFICIAL INTELLIGENCE Broad area which enables computers to mimic human behavior MACHINE LEARNING Usage of statistical tools enables machines to learn from experience (data) – need to be told DEEP LEARNING Learn from its own method of computing - its own brain Why is deep learning useful? Good at classification, clustering and predictive analysis What is deep learning? Deep learning is way of classifying, clustering, and predicting things by using a neural network that has been trained on vast amounts of data. Picture of deep learning demo done by TI’s vehicles road signs person background automotive driver assistance systems (ADAS) team. What is deep learning? Deep learning is way of classifying, clustering, and predicting things by using a neural network that has been trained on vast amounts of data. Machine Music Time of Flight Data Pictures/Video …any type of data Speech you want to classify, Radar cluster or predict What is deep learning? • Deep learning has its roots in neural networks. • Neural networks are sets of algorithms, modeled loosely after the human brain, that are designed to recognize patterns. Biologocal Artificial Biological neuron neuron neuron dendrites inputs synapses weight axon output axon summation and cell body threshold dendrites synapses cell body Node = neuron Inputs Weights Summation W1 x1 & threshold W x 2 2 Output Inputs W3 Output x3 y layer = stack of ∑ ƒ(x) neurons Wn xn ∑=sum(w*x) Artificial neuron 6 What is deep learning? Deep learning creates many layers of neurons, attempting to learn structured representation of big data, layer by layer.
    [Show full text]
  • Face Recognition Using Popular Deep Net Architectures: a Brief Comparative Study
    future internet Article Face Recognition Using Popular Deep Net Architectures: A Brief Comparative Study Tony Gwyn 1,* , Kaushik Roy 1 and Mustafa Atay 2 1 Department of Computer Science, North Carolina A&T State University, Greensboro, NC 27411, USA; [email protected] 2 Department of Computer Science, Winston-Salem State University, Winston-Salem, NC 27110, USA; [email protected] * Correspondence: [email protected] Abstract: In the realm of computer security, the username/password standard is becoming increas- ingly antiquated. Usage of the same username and password across various accounts can leave a user open to potential vulnerabilities. Authentication methods of the future need to maintain the ability to provide secure access without a reduction in speed. Facial recognition technologies are quickly becoming integral parts of user security, allowing for a secondary level of user authentication. Augmenting traditional username and password security with facial biometrics has already seen impressive results; however, studying these techniques is necessary to determine how effective these methods are within various parameters. A Convolutional Neural Network (CNN) is a powerful classification approach which is often used for image identification and verification. Quite recently, CNNs have shown great promise in the area of facial image recognition. The comparative study proposed in this paper offers an in-depth analysis of several state-of-the-art deep learning based- facial recognition technologies, to determine via accuracy and other metrics which of those are most effective. In our study, VGG-16 and VGG-19 showed the highest levels of image recognition accuracy, Citation: Gwyn, T.; Roy, K.; Atay, M. as well as F1-Score.
    [Show full text]
  • Recurrent Neural Network
    Recurrent Neural Network TINGWU WANG, MACHINE LEARNING GROUP, UNIVERSITY OF TORONTO FOR CSC 2541, SPORT ANALYTICS Contents 1. Why do we need Recurrent Neural Network? 1. What Problems are Normal CNNs good at? 2. What are Sequence Tasks? 3. Ways to Deal with Sequence Labeling. 2. Math in a Vanilla Recurrent Neural Network 1. Vanilla Forward Pass 2. Vanilla Backward Pass 3. Vanilla Bidirectional Pass 4. Training of Vanilla RNN 5. Vanishing and exploding gradient problems 3. From Vanilla to LSTM 1. Definition 2. Forward Pass 3. Backward Pass 4. Miscellaneous 1. More than Language Model 2. GRU 5. Implementing RNN in Tensorflow Part One Why do we need Recurrent Neural Network? 1. What Problems are Normal CNNs good at? 2. What is Sequence Learning? 3. Ways to Deal with Sequence Labeling. 1. What Problems are CNNs normally good at? 1. Image classification as a naive example 1. Input: one image. 2. Output: the probability distribution of classes. 3. You need to provide one guess (output), and to do that you only need to look at one image (input). P(Cat|image) = 0.1 P(Panda|image) = 0.9 2. What is Sequence Learning? 1. Sequence learning is the study of machine learning algorithms designed for sequential data [1]. 2. Language model is one of the most interesting topics that use sequence labeling. 1. Language Translation 1. Understand the meaning of each word, and the relationship between words 2. Input: one sentence in German input = "Ich will stark Steuern senken" 3. Output: one sentence in English output = "I want to cut taxes bigly" (big league?) 2.
    [Show full text]
  • Neural Networks and Backpropagation
    10-601 Introduction to Machine Learning Machine Learning Department School of Computer Science Carnegie Mellon University Neural Networks and Backpropagation Neural Net Readings: Murphy -- Matt Gormley Bishop 5 Lecture 20 HTF 11 Mitchell 4 April 3, 2017 1 Reminders • Homework 6: Unsupervised Learning – Release: Wed, Mar. 22 – Due: Mon, Apr. 03 at 11:59pm • Homework 5 (Part II): Peer Review – Expectation: You Release: Wed, Mar. 29 should spend at most 1 – Due: Wed, Apr. 05 at 11:59pm hour on your reviews • Peer Tutoring 2 Neural Networks Outline • Logistic Regression (Recap) – Data, Model, Learning, Prediction • Neural Networks – A Recipe for Machine Learning Last Lecture – Visual Notation for Neural Networks – Example: Logistic Regression Output Surface – 2-Layer Neural Network – 3-Layer Neural Network • Neural Net Architectures – Objective Functions – Activation Functions • Backpropagation – Basic Chain Rule (of calculus) This Lecture – Chain Rule for Arbitrary Computation Graph – Backpropagation Algorithm – Module-based Automatic Differentiation (Autodiff) 3 DECISION BOUNDARY EXAMPLES 4 Example #1: Diagonal Band 5 Example #2: One Pocket 6 Example #3: Four Gaussians 7 Example #4: Two Pockets 8 Example #1: Diagonal Band 9 Example #1: Diagonal Band 10 Example #1: Diagonal Band Error in slides: “layers” should read “number of hidden units” All the neural networks in this section used 1 hidden layer. 11 Example #1: Diagonal Band 12 Example #1: Diagonal Band 13 Example #1: Diagonal Band 14 Example #1: Diagonal Band 15 Example #2: One Pocket
    [Show full text]
  • Deep Layer Aggregation
    Deep Layer Aggregation Fisher Yu Dequan Wang Evan Shelhamer Trevor Darrell UC Berkeley Abstract Visual recognition requires rich representations that span levels from low to high, scales from small to large, and resolutions from fine to coarse. Even with the depth of fea- Dense Connections Feature Pyramids tures in a convolutional network, a layer in isolation is not enough: compounding and aggregating these representa- tions improves inference of what and where. Architectural + efforts are exploring many dimensions for network back- bones, designing deeper or wider architectures, but how to best aggregate layers and blocks across a network deserves Deep Layer Aggregation further attention. Although skip connections have been in- Figure 1: Deep layer aggregation unifies semantic and spa- corporated to combine layers, these connections have been tial fusion to better capture what and where. Our aggregation “shallow” themselves, and only fuse by simple, one-step op- architectures encompass and extend densely connected net- erations. We augment standard architectures with deeper works and feature pyramid networks with hierarchical and aggregation to better fuse information across layers. Our iterative skip connections that deepen the representation and deep layer aggregation structures iteratively and hierarchi- refine resolution. cally merge the feature hierarchy to make networks with better accuracy and fewer parameters. Experiments across architectures and tasks show that deep layer aggregation improves recognition and resolution compared to existing riers, different blocks or modules have been incorporated branching and merging schemes. to balance and temper these quantities, such as bottlenecks for dimensionality reduction [29, 39, 17] or residual, gated, and concatenative connections for feature and gradient prop- agation [17, 38, 19].
    [Show full text]
  • Chapter 10: Artificial Neural Networks
    Chapter 10: Artificial Neural Networks Dr. Xudong Liu Assistant Professor School of Computing University of North Florida Monday, 9/30/2019 1 / 17 Overview 1 Artificial neuron: linear threshold unit (LTU) 2 Perceptron 3 Multi-Layer Perceptron (MLP), Deep Neural Networks (DNN) 4 Learning ANN's: Error Backpropagation Overview 2 / 17 Differential Calculus In this course, I shall stick to Leibniz's notation. The derivative of a function at an input point, when it exists, is the slope of the tangent line to the graph of the function. 2 0 dy Let y = f (x) = x + 2x + 1. Then, f (x) = dx = 2x + 2. A partial derivative of a function of several variables is its derivative with respect to one of those variables, with the others held constant. 2 2 @z Let z = f (x; y) = x + xy + y . Then, @x = 2x + y. The chain rule is a formula for computing the derivative of the composition of two or more functions. dz dz dy 0 0 Let z = f (y) and y = g(x). Then, dx = dy · dx = f (y) · g (x). 1 Nice thing about the sigmoid function f (x) = 1+e−x : f 0(x) = f (x) · (1 − f (x)). Some Preliminaries 3 / 17 Artificial Neuron Artificial neuron, also called linear threshold unit (LTU), by McCulloch and Pitts, 1943: with one or more numeric inputs, it produces a weighted sum of them, applies an activation function, and outputs the result. Common activation functions: step function and sigmoid function. Artificial Neuron 4 / 17 Linear Threshold Unit (LTU) Below is an LTU with the activation function being the step function.
    [Show full text]
  • Increasing Neurons Or Deepening Layers in Forecasting Maximum Temperature Time Series?
    atmosphere Article Increasing Neurons or Deepening Layers in Forecasting Maximum Temperature Time Series? Trang Thi Kieu Tran 1, Taesam Lee 1,* and Jong-Suk Kim 2,* 1 Department of Civil Engineering, ERI, Gyeongsang National University, 501 Jinju-daero, Jinju 660-701, Korea; [email protected] 2 State Key Laboratory of Water Resources and Hydropower Engineering Science, Wuhan University, Wuhan 430072, China * Correspondence: [email protected] (T.L.); [email protected] (J.-S.K.) Received: 8 September 2020; Accepted: 7 October 2020; Published: 9 October 2020 Abstract: Weather forecasting, especially that of extreme climatic events, has gained considerable attention among researchers due to their impacts on natural ecosystems and human life. The applicability of artificial neural networks (ANNs) in non-linear process forecasting has significantly contributed to hydro-climatology. The efficiency of neural network functions depends on the network structure and parameters. This study proposed a new approach to forecasting a one-day-ahead maximum temperature time series for South Korea to discuss the relationship between network specifications and performance by employing various scenarios for the number of parameters and hidden layers in the ANN model. Specifically, a different number of trainable parameters (i.e., the total number of weights and bias) and distinctive numbers of hidden layers were compared for system-performance effects. If the parameter sizes were too large, the root mean square error (RMSE) would be generally increased, and the model’s ability was impaired. Besides, too many hidden layers would reduce the system prediction if the number of parameters was high. The number of parameters and hidden layers affected the performance of ANN models for time series forecasting competitively.
    [Show full text]
  • Introduction to Machine Learning CMU-10701 Deep Learning
    Introduction to Machine Learning CMU-10701 Deep Learning Barnabás Póczos & Aarti Singh Credits Many of the pictures, results, and other materials are taken from: Ruslan Salakhutdinov Joshua Bengio Geoffrey Hinton Yann LeCun 2 Contents Definition and Motivation History of Deep architectures Deep architectures Convolutional networks Deep Belief networks Applications 3 Deep architectures Defintion: Deep architectures are composed of multiple levels of non-linear operations, such as neural nets with many hidden layers. Output layer Hidden layers Input layer 4 Goal of Deep architectures Goal: Deep learning methods aim at . learning feature hierarchies . where features from higher levels of the hierarchy are formed by lower level features. edges, local shapes, object parts Low level representation 5 Figure is from Yoshua Bengio Neurobiological Motivation Most current learning algorithms are shallow architectures (1-3 levels) (SVM, kNN, MoG, KDE, Parzen Kernel regression, PCA, Perceptron,…) The mammal brain is organized in a deep architecture (Serre, Kreiman, Kouh, Cadieu, Knoblich, & Poggio, 2007) (E.g. visual system has 5 to 10 levels) 6 Deep Learning History Inspired by the architectural depth of the brain, researchers wanted for decades to train deep multi-layer neural networks. No successful attempts were reported before 2006 … Researchers reported positive experimental results with typically two or three levels (i.e. one or two hidden layers), but training deeper networks consistently yielded poorer results. Exception: convolutional neural networks, LeCun 1998 SVM: Vapnik and his co-workers developed the Support Vector Machine (1993). It is a shallow architecture. Digression: In the 1990’s, many researchers abandoned neural networks with multiple adaptive hidden layers because SVMs worked better, and there was no successful attempts to train deep networks.
    [Show full text]
  • Introduction to Machine Learning Deep Learning
    Introduction to Machine Learning Deep Learning Barnabás Póczos Credits Many of the pictures, results, and other materials are taken from: Ruslan Salakhutdinov Joshua Bengio Geoffrey Hinton Yann LeCun 2 Contents Definition and Motivation Deep architectures Convolutional networks Applications 3 Deep architectures Defintion: Deep architectures are composed of multiple levels of non-linear operations, such as neural nets with many hidden layers. Output layer Hidden layers Input layer 4 Goal of Deep architectures Goal: Deep learning methods aim at ▪ learning feature hierarchies ▪ where features from higher levels of the hierarchy are formed by lower level features. edges, local shapes, object parts Low level representation 5 Figure is from Yoshua Bengio Theoretical Advantages of Deep Architectures Some complicated functions cannot be efficiently represented (in terms of number of tunable elements) by architectures that are too shallow. Deep architectures might be able to represent some functions otherwise not efficiently representable. More formally: Functions that can be compactly represented by a depth k architecture might require an exponential number of computational elements to be represented by a depth k − 1 architecture The consequences are ▪ Computational: We don’t need exponentially many elements in the layers ▪ Statistical: poor generalization may be expected when using an insufficiently deep architecture for representing some functions. 9 Theoretical Advantages of Deep Architectures The Polynomial circuit: 10 Deep Convolutional Networks 11 Deep Convolutional Networks Compared to standard feedforward neural networks with similarly-sized layers, ▪ CNNs have much fewer connections and parameters ▪ and so they are easier to train, ▪ while their theoretically-best performance is likely to be only slightly worse.
    [Show full text]