Mạng thần kinh thường xuyên cho dự đoán P5
lượt xem 13
download
Mạng thần kinh thường xuyên cho dự đoán P5
Recurrent Neural Networks Architectures Perspective In this chapter, the use of neural networks, in particular recurrent neural networks, in system identiﬁcation, signal processing and forecasting is considered. The ability of neural networks to model nonlinear dynamical systems is demonstrated, and the correspondence between neural networks and blockstochastic models is established. Finally, further discussion of recurrent neural network architectures is provided.
Bình luận(0) Đăng nhập để gửi bình luận!
Nội dung Text: Mạng thần kinh thường xuyên cho dự đoán P5
 Recurrent Neural Networks for Prediction Authored by Danilo P. Mandic, Jonathon A. Chambers Copyright c 2001 John Wiley & Sons Ltd ISBNs: 0471495174 (Hardback); 047084535X (Electronic) 5 Recurrent Neural Networks Architectures 5.1 Perspective In this chapter, the use of neural networks, in particular recurrent neural networks, in system identiﬁcation, signal processing and forecasting is considered. The ability of neural networks to model nonlinear dynamical systems is demonstrated, and the correspondence between neural networks and blockstochastic models is established. Finally, further discussion of recurrent neural network architectures is provided. 5.2 Introduction There are numerous situations in which the use of linear ﬁlters and models is limited. For instance, when trying to identify a saturation type nonlinearity, linear models will inevitably fail. This is also the case when separating signals with overlapping spectral components. Most realworld signals are generated, to a certain extent, by a nonlinear mech anism and therefore in many applications the choice of a nonlinear model may be necessary to achieve an acceptable performance from an adaptive predictor. Commu nications channels, for instance, often need nonlinear equalisers to achieve acceptable performance. The choice of model has crucial importance 1 and practical applications have shown that nonlinear models can oﬀer a better prediction performance than their linear counterparts. They also reveal rich dynamical behaviour, such as limit cycles, bifurcations and ﬁxed points, that cannot be captured by linear models (Gershenfeld and Weigend 1993). By system we consider the actual underlying physics 2 that generate the data, whereas by model we consider a mathematical description of the system. Many vari ations of mathematical models can be postulated on the basis of datasets collected from observations of a system, and their suitability assessed by various performance 1 System identiﬁcation, for instance, consists of choice of the model, model parameter estimation and model validation. 2 Technically, the notions of system and process are equivalent (Pearson 1995; Sj¨berg et al. 1995). o
 70 INTRODUCTION 1 1 0.5 0.5 Neuron output y=tanh(v) 0 0 −0.5 −0.5 −1 −1 −5 0 5 −5 0 5 −5 0 5 −5 0 5 Input signal Figure 5.1 Eﬀects of y = tanh(v) nonlinearity in a neuron model upon two example inputs metrics. Since it is not possible to characterise nonlinear systems by their impulse response, one has to resort to less general models, such as homomorphic ﬁlters, mor phological ﬁlters and polynomial ﬁlters. Some of the most frequently used polynomial ﬁlters are based upon Volterra series (Mathews 1991), a nonlinear analogue of the linear impulse response, threshold autoregressive models (TAR) (Priestley 1991) and Hammerstein and Wiener models. The latter two represent structures that consist of a linear dynamical model and a static zeromemory nonlinearity. An overview of these models can be found in Haber and Unbehauen (1990). Notice that for nonlinear systems, the ordering of the modules within a modular structure 3 plays an important role. To illustrate some important features associated with nonlinear neurons, let us con sider a squashing nonlinear activation function of a neuron, shown in Figure 5.1. For two identical mixed sinusoidal inputs with diﬀerent oﬀsets, passed through this non linearity, the output behaviour varies from amplifying and slightly distorting the input signal (solid line in Figure 5.1) to attenuating and considerably nonlinearly distorting the input signal (broken line in Figure 5.1). From the viewpoint of system theory, neural networks represent nonlinear maps, mapping one metric space to another. 3 To depict this, for two modules performing nonlinear functions H1 = sin(x) and H2 = ex , we have H1 (H2 (x)) = H2 (H1 (x)) since sin(ex ) = esin(x) . This is the reason to use the term nesting rather than cascading in modular neural networks.
 RECURRENT NEURAL NETWORKS ARCHITECTURES 71 Nonlinear system modelling has traditionally focused on Volterra–Wiener analysis. These models are nonparametric and computationally extremely demanding. The Volterra series expansion is given by N N N y(k) = h0 + h1 (i)x(k − i) + h2 (i, j)x(k − i)x(k − j) + · · · (5.1) i=0 i=0 j=0 for the representation of a causal system. A nonlinear system represented by a Volterra series is completely characterised by its Volterra kernels hi , i = 0, 1, 2, . . . . The Volterra modelling of a nonlinear system requires a great deal of computation, and mostly second or thirdorder Volterra systems are used in practice. Since the Volterra series expansion is a Taylor series expansion with memory, they both fail when describing a system with discontinuities, such as y(k) = A sgn(x(k)), (5.2) where sgn( · ) is the signum function. To overcome this diﬃculty, nonlinear parametric models of nonlinear systems, termed NARMAX, that are described by nonlinear diﬀerence equations, have been introduced (Billings 1980; Chon and Cohen 1997; Chon et al. 1999; Connor 1994). Unlike the Volterra–Wiener representation, the NARMAX representation of nonlinear systems oﬀers compact representation. The NARMAX model describes a system by using a nonlinear functional depen dence between lagged inputs, outputs and/or prediction errors. A polynomial expan sion of the transfer function of a NARMAX neural network does not comprise of delayed versions of input and output of order higher than those presented to the net work. Therefore, the input of an insuﬃcient order will result in undermodelling, which complies with Takens’ embedding theorem (Takens 1981). Applications of neural networks in forecasting, signal processing and control require treatment of dynamics associated with the input signal. Feedforward networks for processing of dynamical systems tend to capture the dynamics by including past inputs in the input vector. However, for dynamical modelling of complex systems, there is a need to involve feedback, i.e. to use recurrent neural networks. There are various conﬁgurations of recurrent neural networks, which are used by Jordan (1986) for control of robots, by Elman (1990) for problems in linguistics and by Williams and Zipser (1989a) for nonlinear adaptive ﬁltering and pattern recognition. In Jordan’s network, past values of network outputs are fed back into hidden units, in Elman’s network, past values of the outputs of hidden units are fed back into themselves, whereas in the Williams–Zipser architecture, the network is fully connected, having one hidden layer. There are numerous modular and hybrid architectures, combining linear adaptive ﬁlters and neural networks. These include the pipelined recurrent neural network and networks combining recurrent networks and FIR adaptive ﬁlters. The main idea here is that the linear ﬁlter captures the linear ‘portion’ of the input process, whereas a neural network captures the nonlinear dynamics associated with the process.
 72 OVERVIEW 5.3 Overview The basic modes of modelling, such as parametric, nonparametric, white box, black box and grey box modelling are introduced. Afterwards, the dynamical richness of neural models is addressed and feedforward and recurrent modelling for noisy time series are compared. Blockstochastic models are introduced and neural networks are shown to be able to represent these models. The chapter concludes with an overview of recurrent neural network architectures and recurrent neural networks for NARMAX modelling. 5.4 Basic Modes of Modelling The notions of parametric, nonparametric, black box, grey box and white box mod elling are explained. These can be used to categorise neural network algorithms, such as the direct gradient computation, a posteriori and normalised algorithms. The basic idea behind these approaches to modelling is not to estimate what is already known. One should, therefore, utilise prior knowledge and knowledge about the physics of the system, when selecting the neural network model prior to parameter estimation. 5.4.1 Parametric versus Nonparametric Modelling A review of nonlinear input–output modelling techniques is given in Pearson (1995). Three classes of input–output models are parametric, nonparametric and semipara metric models. We next brieﬂy address them. • Parametric modelling assumes a ﬁxed structure for the model. The model iden tiﬁcation problem then simpliﬁes to estimating a ﬁnite set of parameters of this ﬁxed model. This estimation is based upon the prediction of real input data, so as to best match the input data dynamics. An example of this technique is the broad class of ARIMA/NARMA models. For a given structure of the model (NARMA for instance) we recursively estimate the parameters of the chosen model. • Nonparametric modelling seeks a particular model structure from the input data. The actual model is not known beforehand. An example taken from non parametric regression is that we look for a model in the form of y(k) = f (x(k)) without knowing the function f ( · ) (Pearson 1995). • Semiparametric modelling is the combination of the above. Part of the model structure is completely speciﬁed and known beforehand, whereas the other part of the model is either not known or loosely speciﬁed. Neural networks, especially recurrent neural networks, can be employed within esti mators of all of the above classes of models. Closely related to the above concepts are white, grey and black box modelling techniques.
 RECURRENT NEURAL NETWORKS ARCHITECTURES 73 5.4.2 White, Grey and Black Box Modelling To understand and analyse realworld physical phenomena, various mathematical models have been developed. Depending on some a priori knowledge about the pro cess, data and model, we diﬀerentiate between three fairly general modes of modelling. The idea is to distinguish between three levels of prior knowledge, which have been ‘colourcoded’. An overview of the white, grey and black box modelling techniques can be found in Aguirre (2000) and Sj¨berg et al. (1995). o Given data gathered from planet movements, then Kepler’s gravitational laws might well provide the initial framework in building a mathematical model of the process. This mode of modelling is referred to as white box modelling (Aguirre 2000), under lying its fairly deterministic nature. Static data are used to calculate the parameters, and to do that the underlying physical process has to be understood. It is therefore possible to build a white box model entirely from physical insight and prior knowl edge. However, the underlying physics are generally not completely known, or are too complicated and often one has to resort to other types of modelling. The exact form of the input–output relationship that describes a realworld system is most commonly unknown, and therefore modelling is based upon a chosen set of known functions. In addition, if the model is to approximate the system with an arbitrary accuracy, the set of chosen nonlinear continuous functions must be dense. This is the case with polynomials. In this light, neural networks can be viewed as another mode of functional representations. Black box modelling therefore assumes no previous knowledge about the system that produces the data. However, the chosen network structure belongs to architectures that are known to be ﬂexible and have performed satisfactorily on similar problems. The aim hereby is to ﬁnd a function F that approximates the process y based on the previous observations of process yPAST and input u, as y = F (yPAST , u). (5.3) This ‘black box’ establishes a functional dependence between the input and out put, which can be either linear or nonlinear. The downside is that it is gener ally not possible to learn about the true physical process that generates the data, especially if a linear model is used. Once the training process is complete, a neu ral network represents a black box, nonparametric process model. Knowledge about the process is embedded in the values of the network parameters (i.e. synaptic weights). A natural compromise between the two previous models is socalled grey box mod elling. It is obtained from black box modelling if some information about the system is known a priori. This can be a probability density function, general statistics of the process data, impulse response or attractor geometry. In Sj¨berg et al. (1995), o two subclasses of grey box models are considered: physical modelling, where a model structure is built upon understanding of the underlying physics, as for instance the statespace model structure; and semiphysical modelling, where, based upon physical insight, certain nonlinear combinations of data structures are suggested, and then estimated by black box methodology.
 74 NARMAX MODELS AND EMBEDDING DIMENSION ν(k) u(k) + + y(k) Σ I + e(k) z1 _Σ ... II Neural zM Network ^ y(k) Model zN ... z1 Figure 5.2 Nonlinear prediction conﬁguration using a neural network model 5.5 NARMAX Models and Embedding Dimension For neural networks, the number of input nodes speciﬁes the dimension of the network input. In practice, the true state of the system is not observable and the mathematical model of the system that generates the dynamics is not known. The question arises: is the sequence of measurements {y(k)} suﬃcient to reconstruct the nonlinear sys tem dynamics? Under some regularity conditions, Takens’ (1981) and Mane’s (1981) embedding theorems establish this connection. To ensure that the dynamics of a non linear process estimated by a neural network are fully recovered, it is convenient to use Takens’ embedding theorem (Takens 1981), which states that to obtain a faithful reconstruction of the system dynamics, the embedding dimension d must satisfy d 2D + 1, (5.4) where D is the dimension of the system attractor. Takens’ embedding theorem (Takens 1981; Wan 1993) establishes a diﬀeomorphism between a ﬁnite window of the time series [y(k − 1), y(k − 2), . . . , y(k − N )] (5.5) and the underlying state of the dynamic system which generates the time series. This implies that a nonlinear regression y(k) = g[y(k − 1), y(k − 2), . . . , y(k − N )] (5.6) can model the nonlinear time series. An important feature of the delayembedding theorem due to Takens (1981) is that it is physically implemented by delay lines.
 RECURRENT NEURAL NETWORKS ARCHITECTURES 75 w0 1 w1 x(k1) y(k) w2 y(k1) Figure 5.3 A NARMAX recurrent perceptron with p = 1 and q = 1 There is a deep connection between timelagged vectors and underlying dynamics. Delay vectors are not just a representation of a state of the system, their length is the key to recovering the full dynamical structure of a nonlinear system. A general starting point would be to use a network for which the input vector comprises delayed inputs and outputs, as shown in Figure 5.2. For the network in Figure 5.2, both the input and the output are passed through delay lines, hence indicating the NARMAX character of this network. The switch in this ﬁgure indicates two possible modes of learning which will be explained in Chapter 6. 5.6 How Dynamically Rich are Nonlinear Neural Models? To make an initial step toward comparing neural and other nonlinear models, we perform a Taylor series expansion of the sigmoidal nonlinear activation function of a single neuron model as (Billings et al. 1992) 1 1 β β3 β5 5 17β 7 7 Φ(v(k)) = = + v(k)− v 3 (k)+ v (k)− v (k)+· · · . (5.7) 1 + e−βv(k) 2 4 48 480 80 640 Depending on the steepness β and the activation potential v(k), the polynomial rep resentation (5.7) of the transfer function of a neuron exhibits a complex nonlinear behaviour. Let us now consider a NARMAX recurrent perceptron with p = 1 and q = 1, as shown in Figure 5.3, which is a simple example of recurrent neural networks. Its mathematical description is given by y(k) = Φ(w1 x(k − 1) + w2 y(k − 1) + w0 ). (5.8) Expanding (5.8) using (5.7) yields y(k) = 1 + 1 [w1 x(k−1)+w2 y(k−1)+w0 ]− 48 [w1 x(k−1)+w2 y(k−1)+w0 ]3 +· · · , (5.9) 2 4 1 where β = 1. Expression (5.9) illustrates the dynamical richness of squashing activa tion functions. The associated dynamics, when represented in terms of polynomials are quite complex. Networks with more neurons and hidden layers will produce more complicated dynamics than those in (5.9). Following the same approach, for a general
 76 HOW DYNAMICALLY RICH ARE NONLINEAR NEURAL MODELS? recurrent neural network, we obtain (Billings et al. 1992) y(k) = c0 + c1 x(k − 1) + c2 y(k − 1) + c3 x2 (k − 1) + c4 y 2 (k − 1) + c5 x(k − 1)y(k − 1) + c6 x3 (k − 1) + c7 y 3 (k − 1) + c8 x2 (k − 1)y(k − 1) + · · · . (5.10) Equation (5.10) does not comprise delayed versions of input and output samples of order higher than those presented to the network. If the input vector were of an insuﬃcient order, undermodelling would result, which complies with Takens’ embed ding theorem. Therefore, when modelling an unknown dynamical system or tracking unknown dynamics, it is important to concentrate on the embedding dimension of the network. Representation (5.10) also models an oﬀset (mean value) c0 of the input signal. 5.6.1 Feedforward versus Recurrent Networks for Nonlinear Modelling The choice of which neural network to employ to represent a nonlinear physical process depends on the dynamics and complexity of the network that is best for representing the problem in hand. For instance, due to feedback, recurrent networks may suﬀer from instability and sensitivity to noise. Feedforward networks, on the other hand, might not be powerful enough to capture the dynamics of the underlying nonlinear dynamical system. To illustrate this problem, we resort to a simple IIR (ARMA) linear system described by the following ﬁrstorder diﬀerence equation z(k) = 0.5z(k − 1) + 0.1x(k − 1). (5.11) The system (5.11) is stable, since the pole of its transfer function is at 0.5, i.e. within the unit circle in the zplane. However, in a noisy environment, the output z(k) is corrupted by noise e(k), so that the noisy output y(k) of system (5.11) becomes y(k) = z(k) + e(k), (5.12) which will aﬀect the quality of estimation based on this model. This happens because the noise terms accumulate during recursions 4 (5.11) as y(k) = 0.5y(k − 1) + 0.1x(k − 1) + e(k) − 0.5e(k − 1). (5.13) An equivalent FIR (MA) representation of the same ﬁlter (5.11), using the method of long division, gives z(k) = 0.1x(k − 1) + 0.05x(k − 2) + 0.025x(k − 3) + 0.0125x(k − 4) + · · · (5.14) and the representation of a noisy system now becomes y(k) = 0.1x(k − 1) + 0.05x(k − 2) + 0.025x(k − 3) + 0.0125x(k − 4) + · · · + e(k). (5.15) 4 Notice that if the noise e(k) is zero mean and white it appears coloured in (5.13), i.e. correlated with previous outputs, which leads to biased estimates.
 RECURRENT NEURAL NETWORKS ARCHITECTURES 77 Clearly, the noise in (5.15) is not correlated with the previous outputs and the esti mates are unbiased. 5 The price to pay, however, is the inﬁnite length of the exact representation of (5.11). A similar principle applies to neural networks. In Chapter 6 we address the modes of learning in neural networks and discuss the bias/variance dilemma for recurrent neural networks. 5.7 Wiener and Hammerstein Models and Dynamical Neural Networks Under relatively mild conditions, 6 the output signal of a nonlinear model can be considered as a combination of outputs from some suitable submodels. The structure identiﬁcation, model validation and parameter estimation based upon these submodels are more convenient than those of the whole model. Block oriented stochastic models consist of static nonlinear and dynamical linear modules. Such models often occur in practice, examples of which are • the Hammerstein model, where a zeromemory nonlinearity is followed by a lin ear dynamical system characterised by its transfer function H(z) = N (z)/D(z); • the Wiener model, where a linear dynamical system is followed by a zeromemory nonlinearity. 5.7.1 Overview of BlockStochastic Models The deﬁnitions of certain stochastic models are given by the 1. Wiener system y(k) = g(H(z −1 )u(k)), (5.16) where u(k) is the input to the system, y(k) is the output, C(z −1 ) H(z −1 ) = D(z −1 ) is the zdomain transfer function of the linear component of the system and g( · ) is a nonlinear function; 2. Hammerstein system y(k) = H(z −1 )g(u(k)); (5.17) 3. Uryson system, deﬁned by M y(k) = Hi (z −1 )gi (u(k)). (5.18) i=1 5 Under the usual assumption that the external additive noise e(k) is not correlated with the input signal x(k). 6 A ﬁnite degree polynomial steadystate characteristic.
 78 WIENER AND HAMMERSTEIN MODELS AND DYNAMICAL NNs u(k) nonlinear v(k) N(z) y(k) function D(z) (a) The Hammerstein stochastic model u(k) N(z) v(k) nonlinear y(k) D(z) function (b) The Wiener stochastic model Figure 5.4 Nonlinear stochastic models used in control and signal processing Theoretically, there are ﬁnite size neural systems with dynamic synapses which can represent all of the above. Moreover, some modular neural architectures, such as the PRNN (Haykin and Li 1995), are able to represent blockcascaded Wiener– Hammerstein systems described by (Mandic and Chambers 1999c) y(k) = ΦN (HN (z −1 )ΦN −1 (HN −1 (z −1 ) · · · Φ1 (H1 (z −1 )u(k)))) (5.19) and y(k) = HN (z −1 )ΦN (HN −1 (z −1 )ΦN −1 · · · Φ1 (H1 (z −1 u(k)))) (5.20) under certain constraints relating the size of networks and order of blockstochastic models. Due to its parallel nature, however, a general Uryson model is not guaranteed to be representable this way. 5.7.2 Connection Between BlockStochastic Models and Neural Networks Block diagrams of Wiener and Hammerstein systems are shown in Figure 5.4. The nonlinear function from Figure 5.4(a) can be generally assumed to be a polynomial,7 i.e. M v(k) = λi ui (k). (5.21) i=0 The Hammerstein model is a conventional parametric model, usually used to rep resent processes with nonlinearities involved with the process inputs, as shown in Figure 5.4(a). The equation describing the output of a SISO Hammerstein system corrupted with additive output noise η(k) is ∞ y(k) = Φ[u(k − 1)] + hi Φ[u(k − i)] + ν(k), (5.22) i=2 where Φ is a nonlinear function which is continuous. Other requirements are that the linear dynamical subsystem is stable. This network is shown in Figure 5.5.
 RECURRENT NEURAL NETWORKS ARCHITECTURES 79 ν(k) + + Φ {h} Σ u(k) y(k) Figure 5.5 Discretetime SISO Hammerstein model with observation noise u 1(k) u 2(k) w1(k) x(k) N(z) v(k) ... Σ D(z) y(k) up(k) wp (k) Linear Zero Memory Transfer Function Nonlinearity Figure 5.6 Dynamic perceptron Neural networks with locally distributed dynamics (LDNN) can be considered as locally recurrent networks with global feedforward features. An example of these net works is the dynamical multilayer perceptron (DMLP) which consists of dynamical neurons and is shown in Figure 5.6. The model of this dynamic perceptron is described by y(k) = Φ(v(k)), deg(N (z)) deg(D(z)) v(k) = ni (k)x(k − i) + 1 + dj (k)v(k − j), (5.23) i=0 j=1 p x(k) = wl (k)ul (k), l=1 where ni and di denote, respectively, the coeﬃcients of the polynomials in N (z) and D(z) and ‘1’ is included for a possible bias input. From Figure 5.6, the transfer function between y(k) and x(k) represents a Wiener system. Hence, combinations of dynamical perceptrons (such as a recurrent neural network) are able to represent blockstochastic Wiener–Hammerstein models. Gradientbased learning rules can be developed for a recurrent neural network representing blockstochastic models. Both the Wiener and Hammerstein models can exhibit a more general structure, as shown in Figure 5.7, for the Hammerstein model. Wiener and Hammerstein models can be combined to produce more complicated blockstochastic models. A representative of these models is the Wiener–Hammerstein model, shown in Figure 5.8. This ﬁgure shows a Wiener stochastic model, followed by a linear dynamical system represented by its transfer function H2 (z) = N2 (z)/D2 (z), hence building a Wiener–Hammerstein 7 By the Weierstrass theorem, polynomials can approximate arbitrarily well any nonlinear function, including sigmoid functions.
 80 WIENER AND HAMMERSTEIN MODELS AND DYNAMICAL NNs ν(k) Η1 (z) Σ u(k) y(k) u 2(k) Π Η2(z) ... uN(k) Π ΗN(z) N multiplications Figure 5.7 Generalised Hammerstein model u(k) N1(z) nonlinear N2(z) y(k) D 1(z) function D2(z) Figure 5.8 The Wiener–Hammerstein model blockstochastic system. In practice, we can build complicated block cascaded systems this way. Wiener and Hammerstein systems are frequently used to compensate each other (Kang et al. 1998). This includes ﬁnding an inverse of the ﬁrst module in the com bination. If these models are represented by neural networks, Chapter 4 provides a general framework for uniqueness, existence and convergence of inverse neural mod els. The following example from Billings and Voon (1986) shows that the Wiener model can be represented by a NARMA model, which, in turn can be modelled by a recurrent neural network. Example 5.7.1. The Wiener model w(k) = 0.8w(k − 1) + 0.4u(k − 1), (5.24) y(k) = w(k) + w3 (k) + e(k), was identiﬁed as y(k) = 0.7578y(k − 1) + 0.3891u(k − 1) − 0.037 23y 2 (k − 1) + 0.3794y(k − 1)u(k − 1) + 0.0684u2 (k − 1) + 0.1216y(k − 1)u2 (k − 1) + 0.0633u3 (k − 1) − 0.739e(k − 1) − 0.368u(k − 1)e(k − 1) + e(k), (5.25) which is a NARMA model, and hence can be realised by a recurrent neural network.
 RECURRENT NEURAL NETWORKS ARCHITECTURES 81 u(k) Linear Dynamical v(k) y(k) ... Σ Φ System (a) Activation feedback scheme u(k) Linear v(k) y(k) ... Dynamical Σ Φ System (b) Output feedback scheme Figure 5.9 Recurrent neural network architectures 5.8 Recurrent Neural Network Architectures Two straightforward ways to include recurrent connections in neural networks are activation feedback and output feedback , as shown, respectively, in Figure 5.9(a) and Figure 5.9(b). These schemes are closely related to the state space representation of neural networks. A comprehensive and insightful account of canonical forms and state space representation of general neural networks is given in Nerrand et al. (1993) and Dreyfus and Idan (1998). In Figure 5.9, the blocks labelled ‘linear dynamical systems’ comprise of delays and multipliers, hence providing linear combination of their input signals. The output of a neuron shown in Figure 5.9(a) can be expressed as M N v(k) = wu,i (k)u(k − i) + wv,j (k)v(k − j), (5.26) i=0 j=1 y(k) = Φ(v(k)), where wu,i and wv,j correspond to the weights associated with u and v, respectively. The transfer function of a neuron shown in Figure 5.9(b) can be expressed as M N v(k) = wu,i (k)u(k − i) + wy,j (k)y(k − j), (5.27) i=0 j=1 y(k) = Φ(v(k)),
 82 RECURRENT NEURAL NETWORK ARCHITECTURES H1 u 1 (k) H2 u 2 (k) Σ Φ y(k) uM (k) ... HM HFB Figure 5.10 General LRGF architecture y(k) z1(k) z 2(k) Feedback with Delay x 1(k) x 2(k) x 3(k) z 1(k−1) z 2(k−1) Figure 5.11 An example of Elman recurrent neural network where wy,j correspond to the weights associated with the delayed outputs. A compre hensive account of types of synapses and shortterm memories in dynamical neural networks is provided by Mozer (1993). The networks mentioned so far exhibit a locally recurrent architecture, but when connected into a larger network, they have a feedforward structure. Hence they are referred to as locally recurrent–globally feedforward (LRGF) architectures. A gen eral LRGF architecture is shown in Figure 5.10. This architecture allows for the dynamic synapses both within the input (represented by H1 , . . . , HM ) and the out put feedback (represented by HFB ), hence comprising some of the aforementioned schemes. The Elman network is a recurrent network with a hidden layer, a simple example of which is shown in Figure 5.11. This network consists of an MLP with an additional input which consists of delayed state space variables of the network. Even though it contains feedback connections, it is treated as a kind of MLP. The network shown in
 RECURRENT NEURAL NETWORKS ARCHITECTURES 83 y1(k) y2(k) z 1(k) Feedback with z 2(k) Delay x 1(k) x 2(k) x 3(k) y1 (k−1) y2 (k−1) Figure 5.12 An example of Jordan recurrent neural network Figure 5.12 is an example of the Jordan network. It consists of a multilayer perceptron with one hidden layer and a feedback loop from the output layer to an additional input called the context layer. In the context layer, there are selfrecurrent loops. Both Jordan and Elman networks are structurally locally recurrent globally feedforward (LRGF), and are rather limited in including past information. A network with a rich representation of past outputs, which will be extensively considered in this book, is a fully connected recurrent neural network, known as the Williams–Zipser network (Williams and Zipser 1989a), shown in Figure 5.13. We give a detailed introduction to this architecture. This network consists of three layers: the input layer, the processing layer and the output layer. For each neuron i, i = 1, 2, . . . , N , the elements uj , j = 1, 2, . . . , p + N + 1, of the input vector to a neuron u (5.31), are weighted, then summed to produce an internal activation function of a neuron v (5.30), which is ﬁnally fed through a nonlinear activation function Φ (5.28), to form the output of the ith neuron yi (5.29). The function Φ is a monotonically increasing sigmoid function with slope β, as for instance the logistic function, 1 Φ(v) = . (5.28) 1 + e−βv At the time instant k, for the ith neuron, its weights form a (p + N + 1) × T 1 dimensional weight vector wi (k) = [wi,1 (k), . . . , wi,p+N +1 (k)], where p is the number of external inputs, N is the number of feedback connections and ( · )T denotes the vector transpose operation. One additional element of the weight vec tor w is the bias input weight. The feedback consists of the delayed output signals of the RNN. The following equations fully describe the RNN from Fig
 84 HYBRID NEURAL NETWORK ARCHITECTURES ... ... Feedback inputs z1 ... Outputs ... ... z1 y z1 ... z1 ... s(k1) External ... Inputs s(kp) Feedforward Processing layer of I/O layer and hidden and output Feedback connections neurons Figure 5.13 A fully connected recurrent neural network ure 5.13, yi (k) = Φ(vi (k)), i = 1, 2, . . . , N, (5.29) p+N +1 vi (k) = wi,l (k)ul (k), (5.30) l=1 uT (k) = [s(k − 1), . . . , s(k − p), 1, y1 (k − 1), y2 (k − 1), . . . , yN (k − 1)], i (5.31) where the (p + N + 1) × 1 dimensional vector u comprises both the exter nal and feedback inputs to a neuron, as well as the unity valued constant bias input. 5.9 Hybrid Neural Network Architectures These networks consist of a cascade of a neural network and a linear adaptive ﬁlter. If a neural network is considered as a complex adaptable nonlinearity, then hybrid neural networks resemble Wiener and Hammerstein stochastic models. An example of these networks is given in Khalaf and Nakayama (1999), for prediction of noisy time series. A neural subpredictor is cascaded with a linear FIR predictor, hence making a hybrid predictor. The block diagram of this type of neural network architecture is
 RECURRENT NEURAL NETWORKS ARCHITECTURES 85 x(k) Desired Signal + + Σ Σ _ _ z1 Neural Linear Network yNN(k) Predictor y(k) Figure 5.14 A hybrid neural predictor s(kM) s(kM+1) s(kM+2) s(k1) s(k) z 1 I z 1 I z 1 I p p p p module M yM,1 (k) module (M1) y(M1),1 (k) y 2,1 (k) module 1 yout(k) weight matrix W weight matrix W weight matrix W z 1 I z 1 I z 1 I (N1) (N1) (N1) yM,1 (k1) z 1 Figure 5.15 Pipelined recurrent neural network given in Figure 5.14. The neural network from Figure 5.14 can be either a feedforward neural network or a recurrent neural network. Another example of hybrid structures is the socalled pipelined recurrent neural network (PRNN), introduced by Haykin and Li (1995) and shown in Figure 5.15. It consists of a modular nested structure of smallscale fully connected recurrent neural networks and a cascaded FIR adaptive ﬁlter. In the PRNN conﬁguration, the M modules, which are FCRNNs, are connected as shown in Figure 5.15. The cascaded linear ﬁlter is omitted. The description of this network follows the approach from Mandic et al. (1998) and Baltersee and Chambers (1998). The uppermost module of the PRNN, denoted by M , is simply an FCRNN, whereas in modules (M − 1, . . . , 1), the only diﬀerence is that the feedback signal of the output neuron within module m, denoted by ym,1 , m = 1, . . . , M − 1, is replaced with the appropriate output signal ym+1,1 , m = 1, . . . , M − 1, from its left neighbour module m + 1. The (p × 1) dimensional external signal vector sT (k) = [s(k), . . . , s(k − p + 1)] is delayed by m time steps (z −m I) before feeding the module m, where z −m , m = 1, . . . , M , denotes the mstep time delay operator and I is the (p × p)dimensional identity matrix. The weight vectors wn of each neuron n, are embodied in an (p + N + 1) × N dimensional weight matrix W (k) = [w1 (k), . . . , wN (k)], with N being the number of neurons in
 86 NONLINEAR ARMA MODELS AND RECURRENT NETWORKS each module. All the modules operate using the same weight matrix W . The overall output signal of the PRNN is yout (k) = y1,1 (k), i.e. the output of the ﬁrst neuron of the ﬁrst module. A full mathematical description of the PRNN is given in the following equations: yi,n (k) = Φ(vi,n (k)), (5.32) p+N +1 vi,n (k) = wn,l (k)ui,l (k), (5.33) l=1 uT (k) = [s(k − i), . . . , s(k − i − p + 1), 1, i yi+1,1 (k), yi,2 (k − 1), . . . , yi,N (k − 1)] for 1 i M − 1, (5.34) uT (k) M = [s(k − M ), . . . , s(k − M − p + 1), 1, yM,1 (k − 1), yM,2 (k − 1), . . . , yM,N (k − 1)] for i = M. (5.35) At the time step k for each module i, i = 1, . . . , M , the onestep forward prediction error ei (k) associated with a module is then deﬁned as a diﬀerence between the desired response of that module s(k −i+1), which is actually the next incoming sample of the external input signal, and the actual output of the ith module yi,1 (k) of the PRNN, i.e. ei (k) = s(k − i + 1) − yi,1 (k), i = 1, . . . , M. (5.36) Thus, the overall cost function of the PRNN becomes a weighted sum of all squared error signals, M E(k) = λi−1 e2 (k), i (5.37) i=1 where ei (k) is deﬁned in Equation (5.36) and λ, λ ∈ (0, 1], is a forgetting factor. Other architectures combining linear and nonlinear blocks include the socalled ‘sandwich’ structure which was used for estimation of Hammerstein systems (Ibnkahla et al. 1998). The architecture used was a linear–nonlinear–linear combination. 5.10 Nonlinear ARMA Models and Recurrent Networks A general NARMA(p, q) recurrent network model can be expressed as (Chang and Hu 1997) p p+q+1 x(k) = Φ ˆ w1,i (k)x(k − i) + w1,p+1 (k) + w1,j (k)ˆ(k + j − 2 − p − q) e i=1 j=p+2 p+q+N + w1,l (k)yl−p−q (k − 1) . (5.38) l=p+q+2 A realisation of this model is shown in Figure 5.16. The NARMA(p, q) scheme shown in Figure 5.16 is a common Williams–Zipser type recurrent neural network, which
 RECURRENT NEURAL NETWORKS ARCHITECTURES 87 x(k) z 1 x(k1) _ + z 1 Σ y1(k) = ^ x(k) ^ e (k) x(k2) ... z 1 y2(k) x(kp) ... +1 ^ e(kq) ... z 1 yN(k) ^ e(k1) z 1 z1 ... z1 ... Figure 5.16 Alternative recurrent NARMA(p, q) network consists of only two layers, the output layer of output and hidden neurons y1 , . . . , yN , and the input layer of feedforward and feedback signals x(k − 1), . . . , x(k − p), +1, e(k − 1), . . . , e(k − q), y2 (k − 1), . . . , yN (k − 1). ˆ ˆ The nonlinearity in this case is determined by both the nonlinearity associated with the output neuron of the recurrent neural network and nonlinearities in hidden neu rons. The inputs to this network, given in (5.38), however, comprise the prediction error terms (residuals) e(k −1), . . . , e(k −q), which make the learning in such networks diﬃ ˆ ˆ cult. Namely, the wellknown realtime recurrent learning (RTRL) algorithm (Haykin 1994; Williams and Zipser 1989a) was derived to minimise the instantaneous squared prediction error e(k), and hence cannot be applied directly to the RNN realisations ˆ of the NARMA(p, q) network, as shown above, since the inputs to the network com prise the delayed prediction error terms {ˆ}. It is therefore desirable to ﬁnd another e
 88 NONLINEAR ARMA MODELS AND RECURRENT NETWORKS equivalent representation of the NARMA(p, q) network, which would be more suited for the RTRLbased learning. If, for the sake of clarity, we denote the predicted values x by y, i.e. to match the ˆ notation common in RNNs with the NARMA(p, q) theory, and have y1 (k) = x(k), ˆ and keep the symbol x for the exact values of the input signal being predicted, the NARMA network from (5.38), can be approximated further as (Connor 1994) y1 (k) = h(x(k − 1), x(k − 2), . . . , x(k − p), e(k − 1), e(k − 2), . . . , e(k − q)) ˆ ˆ ˆ = h(x(k − 1), x(k − 2), . . . , x(k − p), (x(k − 1) − y1 (k − 1)), . . . . . . , (x(k − q) − y1 (k − q))) = H(x(k − 1), x(k − 2), . . . , x(k − p), y1 (k − 1), . . . , y1 (k − q)). (5.39) In that case, the scheme shown in Figure 5.16 should be redrawn, remaining topolog ically the same, with y1 replacing the corresponding e terms among the inputs to the ˆ network. On the other hand, the alternative expression for the conditional mean predictor, depicted in Figure 5.16 can be written as p p+q+1 x(k) = Φ ˆ w1,i (k)x(k − i) + w1,p+1 (k) + w1,j (k)ˆ(k + j − 2 − p − q) x i=1 j=p+2 p+q+N + w1,l (k)yl−p−q (k − 1) (5.40) l=p+q+2 or, bearing in mind (5.39), the notation used earlier (Haykin and Li 1995; Mandic et al. 1998) for the examples on the prediction of speech, i.e. x(k) = s(k), and that y1 (k) = s(k), ˆ p p+q+1 s(k) = Φ ˆ w1,i (k)s(k − i) + w1,p+1 (k) + w1,j (k)y1 (k + j − 2 − p − q) i=1 j=p+2 p+q+N + w1,l (k)yl−p−q (k − 1) , (5.41) l=p+q+2 which is the common RNN lookalike notation. This scheme oﬀers a simpler solution to the NARMA(p, q) problem, as compared to the previous one, since the only nonlinear function used is the activation function of a neuron Φ, while the set of signals being processed is the same as in the previous scheme. Furthermore, the scheme given in (5.41) and depicted in Figure 5.17 resembles the basic ARMA structure. Li (1992) has shown that the recurrent network of (5.41) with a suﬃciently large number of neurons and appropriate weights can be found by performing the RTRL algorithm such that the sum of squared prediction errors E < δ for an arbitrary δ > 0. In other words, s − s D < δ, where · D denotes the L2 norm with respect ˆ to the training set D. Moreover, this scheme, shown also in Figure 5.17, ﬁts into the wellknown learning strategies, such as the RTRL algorithm, which recommends this
CÓ THỂ BẠN MUỐN DOWNLOAD

Các Câu Hỏi Ôn Tập: Mạng Cảm Biến  WSN
15 p  134  62

Mạng thần kinh thường xuyên cho dự đoán P1
8 p  78  23

Mạng thần kinh thường xuyên cho dự đoán P2
21 p  54  16

Mạng thần kinh thường xuyên cho dự đoán P9
12 p  64  15

Mạng thần kinh thường xuyên cho dự đoán P4
0 p  54  14

Mạng thần kinh thường xuyên cho dự đoán P3
16 p  46  13

Mạng nơ ron và giải thuật di truyền ứng dụng cho nhận dạng ký tự viết tay.
9 p  41  12

Mạng thần kinh thường xuyên cho dự đoán P6
24 p  46  10

Mạng thần kinh thường xuyên cho dự đoán P11
28 p  48  10

Mạng thần kinh thường xuyên cho dự đoán P8
14 p  55  9

Mạng thần kinh thường xuyên cho dự đoán P12
21 p  67  9

Mạng thần kinh thường xuyên cho dự đoán P10
9 p  61  8

Mạng thần kinh thường xuyên cho dự đoán P7
19 p  63  8

Bài giảng Mạng nơron và ứng dụng trong xử lý tín hiệu: Các mạng nơron đơn giản dùng cho phân loại mẫu  Nguyễn Công Phương
40 p  26  6

Dự báo nhu cầu vốn đầu tư và phương hướng chủ yếu thu hút và sử dụng các nguồn vốn đầu tư cho giáo dục đại học Việt Nam giai đoạn 20002009.
7 p  30  4

Bài giảng Bài 2: Tổng quan về quản lý dự án và lựa chọn và lập kế hoạch cho dự án
58 p  36  4

Về một công cụ khai thác cơ sở dữ liệu OracleDiscoverer.
7 p  47  3