Lecture 7 - Introduction to Neural Networks
This lecture was an introduction to neural networks. Different people have had different exposure to neural networks, and there have been introductory lectures on this topic in other courses this semester such as NLU. Therefore this lecture focused more on aspects particular to speech recognition, and also had a fair amount of question and answer. If you are unfamiliar with this material, it is recommended to read the chapters 1 and 2, and the first part of chapter 3, of Michael Nielson's online book Neural Networks and Deep Learning.
- Motivation using the notion of local phonetic scores - dynamic time warping and hidden Markov models can both be interpreted as having a sequence modelling part (the state sequence in an HMM) and a local phonetic score part - the output/emission probabilities in an HMM (typically Gaussians or Gaussian mixtures) or the Euclidean distance between frames in dynamic time warping. We can motivate the use of neural networks as a way of estimating such local scores.
- If the score for each phoneme is weighted sum of the input features (which might be MFCCs), then this corresponds to a linear (single layer) network.
- To train a network we use the concept of an error function - the difference between the output of the network and the target output. Because the output of the network depends on the weights, the error function can also be considered a function of the weights. Optimising the network consists of adjusting the weights to reduce the error function.
- If the network is trained to identify phonemes, then the output and target vector has a length equal to the number of phonemes. The target vector is one-hot, with the component corresponding to the target phone being 1, the other components being 0. You can think of the output vector giving an estimate of the probability of each phone given the input.
- Gradient descent is used to optimise the network. The key to this is estimating the gradient of the error function with respect to the weights. We can then use this to change the weights such that the error function is decreasing (move downhill). For a weight in a single-layer network (with the mean square error function) the gradient has the nice form of a product between the difference between the target and output multiplied by the input.
- When using neural networks for speech recognition we are not restricted to using a single frame for input. We can also use multiple frames of acoustic context before and after the target frame.
- So far we have discussed linear single layer networks. We can construct more powerful networks if we add hidden layers. Hidden layers also have a non-linearity (e.g. relu) when the network is trained hidden layers can learn representations from the layer below. This hierarchical model of rivhser representations, layer-by-layer, is not something achievable with linear networks. (Note that a GMM can be considered as a network with a single hidden layer, the Gaussians.)
- Training a multi-layer network can also be achieved with gradient descent, using the back-propagation algorithm which gives away to propagate gradients backwards through the network.
Copyright (c) University of Edinburgh 2015-2018
The ASR course material is licensed under the
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International Public License
licence.txt
This page maintained by Steve Renals.
Last updated: 2018/02/06 17:46:51UTC
