Analyzing the Structure of Attention in a Transformer Language Model

Total Page:16

File Type:pdf, Size:1020Kb

Analyzing the Structure of Attention in a Transformer Language Model Analyzing the Structure of Attention in a Transformer Language Model Jesse Vig Yonatan Belinkov Palo Alto Research Center Harvard John A. Paulson School of Machine Learning and Engineering and Applied Sciences and Data Science Group MIT Computer Science and Interaction and Analytics Lab Artificial Intelligence Laboratory Palo Alto, CA, USA Cambridge, MA, USA [email protected] [email protected] Abstract attention in NLP models, ranging from attention matrix heatmaps (Bahdanau et al., 2015; Rush The Transformer is a fully attention-based et al., 2015; Rocktaschel¨ et al., 2016) to bipartite alternative to recurrent networks that has graph representations (Liu et al., 2018; Lee et al., achieved state-of-the-art results across a range of NLP tasks. In this paper, we analyze 2017; Strobelt et al., 2018). A visualization tool the structure of attention in a Transformer designed specifically for multi-head self-attention language model, the GPT-2 small pretrained in the Transformer (Jones, 2017; Vaswani et al., model. We visualize attention for individ- 2018) was introduced in Vaswani et al.(2017). ual instances and analyze the interaction be- We extend the work of Jones(2017), by visu- tween attention and syntax over a large cor- alizing attention in the Transformer at three lev- pus. We find that attention targets different parts of speech at different layer depths within els of granularity: the attention-head level, the the model, and that attention aligns with de- model level, and the neuron level. We also adapt pendency relations most strongly in the mid- the original encoder-decoder implementation to dle layers. We also find that the deepest layers the decoder-only GPT-2 model, as well as the of the model capture the most distant relation- encoder-only BERT model. ships. Finally, we extract exemplar sentences In addition to visualizing attention for individ- that reveal highly specific patterns targeted by ual inputs to the model, we also analyze attention particular attention heads. in aggregate over a large corpus to answer the fol- 1 Introduction lowing research questions: Contextual word representations have recently • Does attention align with syntactic depen- been used to achieve state-of-the-art perfor- dency relations? mance across a range of language understanding tasks (Peters et al., 2018; Radford et al., 2018; • Devlin et al., 2018). These representations are Which attention heads attend to which part- obtained by optimizing a language modeling (or of-speech tags? similar) objective on large amounts of text. The underlying architecture may be recurrent, as in • How does attention capture long-distance re- ELMo (Peters et al., 2018), or based on multi-head lationships versus short-distance ones? self-attention, as in OpenAI’s GPT (Radford et al., 2018) and BERT (Devlin et al., 2018), which are We apply our analysis to the GPT-2 small pre- based on the Transformer (Vaswani et al., 2017). trained model. We find that attention follows de- Recently, the GPT-2 model (Radford et al., 2019) pendency relations most strongly in the middle outperformed other language models in a zero- layers of the model, and that attention heads tar- shot setting, again based on self-attention. get particular parts of speech depending on layer An advantage of using attention is that it can depth. We also find that attention spans the great- help interpret the model by showing how the est distance in the deepest layers, but varies signif- model attends to different parts of the input (Bah- icantly between heads. Finally, our method for ex- danau et al., 2015; Belinkov and Glass, 2019). tracting exemplar sentences yields many intuitive Various tools have been developed to visualize patterns. 63 Proceedings of the Second BlackboxNLP Workshop on Analyzing and Interpreting Neural Networks for NLP, pages 63–76 Florence, Italy, August 1, 2019. c 2019 Association for Computational Linguistics 2 Related Work multi-head setting, the queries, keys, and values are linearly projected h times, and the attention Recent work suggests that the Transformer im- operation is performed in parallel for each repre- plicitly encodes syntactic information such as de- sentation, with the results concatenated. pendency parse trees (Hewitt and Manning, 2019; Raganato and Tiedemann, 2018), anaphora (Voita et al., 2018), and subject-verb pairings (Goldberg, 4 Visualizing Individual Inputs 2019; Wolf, 2019). Other work has shown that RNNs also capture syntax, and that deeper layers In this section, we present three visualizations of in the model capture increasingly high-level con- attention in the Transformer model: the attention- structs (Blevins et al., 2018). head view, the model view, and the neuron view. In contrast to past work that measure a model’s Source code and Jupyter notebooks are avail- syntactic knowledge through linguistic probing able at https://github.com/jessevig/ tasks, we directly compare the model’s atten- bertviz, and a video demonstration can be tion patterns to syntactic constructs such as de- found at https://vimeo.com/339574955. pendency relations and part-of-speech tags. Ra- A more detailed discussion of the tool is provided ganato and Tiedemann(2018) also evaluated de- in Vig(2019). pendency trees induced from attention weights in a Transformer, but in the context of encoder-decoder 4.1 Attention-head View translation models. The attention-head view (Figure1) visualizes at- 3 Transformer Architecture tention for one or more heads in a model layer. Self-attention is depicted as lines connecting the Stacked Decoder: GPT-2 is a stacked decoder attending tokens (left) with the tokens being at- Transformer, which inputs a sequence of tokens tended to (right). Colors identify the head(s), and and applies position and token embeddings fol- line weight reflects the attention weight. This view lowed by several decoder layers. Each layer ap- closely follows the design of Jones(2017), but has plies multi-head self-attention (see below) in com- been adapted to the GPT-2 model (shown in the bination with a feedforward network, layer nor- figure) and BERT model (not shown). malization, and residual connections. The GPT-2 small model has 12 layers and 12 heads. Self-Attention: Given an input x, the self- attention mechanism assigns to each token xi a set of attention weights over the tokens in the input: Attn(xi) = (αi;1(x); αi;2(x); :::; αi;i(x)) (1) where αi;j(x) is the attention that xi pays to xj. The weights are positive and sum to one. Attention in GPT-2 is right-to-left, so αi;j is defined only for j ≤ i. In the multi-layer, multi-head setting, α is specific to a layer and head. The attention weights αi;j(x) are computed from the scaled dot-product of the query vector of xi and the key vector of xj, followed by a softmax operation. The attention weights are then used to produce a weighted sum of value vectors: Figure 1: Attention-head view of GPT-2 for layer 4, head 11, which focuses attention on previous token. QKT Attention(Q; K; V ) = softmax( p )V (2) This view helps focus on the role of specific at- d k tention heads. For instance, in the shown example, using query matrix Q, key matrix K, and value the chosen attention head attends primarily to the matrix V , where dk is the dimension of K. In a previous token position. 64 5 Analyzing Attention in Aggregate In this section we explore the aggregate proper- ties of attention across an entire corpus. We ex- amine how attention interacts with syntax, and we compare long-distance versus short-distance rela- tionships. We also extract exemplar sentences that reveal patterns targeted by each attention head. 5.1 Methods 5.1.1 Part-of-Speech Tags Past work suggests that attention heads in the Transformer may specialize in particular linguis- Figure 2: Model view of GPT-2, for same input as in tic phenomena (Vaswani et al., 2017; Raganato Figure1 (excludes layers 6–11 and heads 6–11). and Tiedemann, 2018; Vig, 2019). We explore whether individual attention heads in GPT-2 target 4.2 Model View particular parts of speech. Specifically, we mea- sure the proportion of total attention from a given The model view (Figure2) visualizes attention head that focuses on tokens with a given part-of- across all of the model’s layers and heads for a speech tag, aggregated over a corpus: particular input. Attention heads are presented in tabular form, with rows representing layers and jxj i P P P 1 columns representing heads. Each head is shown αi;j(x)· pos(xj )=tag x2X i=1 j=1 in a thumbnail form that conveys the coarse shape Pα(tag) = (3) jxj i of the attention pattern, following the small multi- P P P αi;j(x) ples design pattern (Tufte, 1990). Users may also x2X i=1 j=1 click on any head to enlarge it and see the tokens. This view facilitates the detection of coarse- where tag is a part-of-speech tag, e.g., NOUN, x is grained differences between heads. For example, a sentence from the corpus X, αi;j is the attention several heads in layer 0 share a horizontal-stripe from xi to xj for the given head (see Section3), pattern, indicating that tokens attend to the current and pos(xj) is the part-of-speech tag of xj. We position. Other heads have a triangular pattern, also compute the share of attention directed from showing that they attend to the first token. In the each part of speech in a similar fashion. deeper layers, some heads display a small number of highly defined lines, indicating that they are tar- 5.1.2 Dependency Relations geting specific relationships between tokens.
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]