Artificial Intelligence and Quantum Computing for Advanced Wireless Networks. Savo G. Glisic

is expected to obtain a small ρ in order to make a good approximation.

Hybrid learning algorithm: Parameter ρ in Eq. (4.65) is not small enough in many situations. In order to obtain a better approximation, a hybrid learning algorithm including a linear ridge regression algorithm and the gradient descent method can be used to adjust Θ and θ_0i according to the experience of Eq. (4.62) [105]. The performance measure is defined as

(4.66)

      where α is a weighted parameter that defines the relative trade‐off between the squared error loss and the experienced loss, and e₁(x_k) = y_k − f_FM(x_k), e₂(x_k) = f_SVR(x_k) − f_FM(x_k). Thus, the error between the desired output and actual output is characterized by the first term, and the second term measures the difference between the actual output and the experienced output of SVR. Therefore, each epoch of the hybrid learning algorithm is composed of a forward pass and a backward pass which implement the linear ridge regression algorithm and the gradient descent method in E over parameters Θ and θ_0i . Here, θ_0i are identified by the linear ridge regression in the forward pass. In addition, it is assumed that the Gaussian membership function is employed, and thus Θ_j is referred as to σ_j . Using Eqs. (4.62) and (4.63), and defining

      (4.67)

then, at the minimum point of Eq. (4.66) all derivatives with respect to θ_0i should vanish:

      (4.68)

      These conditions can be rewritten in the form of normal equations:

      (4.69)

      where m = 1, … , c′. This is a standard problem that forms the grounds for linear regression, and the most well‐known formula for estimating θ = [θ₀₁ θ₀₂ ⋯ θ_0c′]^T uses the ridge regression algorithm:

      (4.70)

      where δ is a positive scalar, and

      (4.71)

      where ,

      ψ(x_k) = [φ₁(x_k), φ₂(x_k), ⋯, φ_c′(x_k)]^T, k = 1, … n. In the backward pass, the error rates propagate backward and σ_j are updated by the gradient descent method. The derivatives with respect to are calculated from

      (4.72)

Скачать книгу