CS621 : Artificial Intelligence

1. CS621 : Artificial Intelligence Pushpak BhattacharyyaCSE Dept., IIT Bombay Lecture 24 Sigmoid neuron and backpropagation

2. Feedforward n/w • A multilayer feedforward neural network has • Input layer • Output layer • Hidden layer (assists computation) Output units and hidden units are called computation units.

3. Architecture of the n/w …. Output layer (m o/p neurons) j • Fully connected feed forward network • Pure FF network (no jumping of connections over layers) wji …. i Hidden layers …. …. Input layer (n i/p neurons)

4. Training of the MLP • Multilayer Perceptron (MLP) • Question:- How to find weights for the hidden layers when no target output is available? • Credit assignment problem – to be solved by “Gradient Descent”

5. Gradient Descent Technique • Let E be the error at the output layer • ti = target output; oi = observed output • i is the index going over n neurons in the outermost layer • j is the index going over the p patterns (1 to p) • Ex: XOR:– p=4 and n=1

6. Weights in a ff NN • wmn is the weight of the connection from the nth neuron to the mth neuron • E vs surface is a complex surface in the space defined by the weights wij • gives the direction in which a movement of the operating point in the wmn co-ordinate space will result in maximum decrease in error m wmn n

7. Sigmoid neurons • Gradient Descent needs a derivative computation - not possible in perceptron due to the discontinuous step function used!  Sigmoid neurons with easy-to-compute derivatives used! • Computing power comes from non-linearity of sigmoid function.

8. Derivative of Sigmoid function

9. Training algorithm • Initialize weights to random values. • For input x = <xn,xn-1,…,x0>, modify weights as follows Target output = t, Observed output = o • Iterate until E <  (threshold)

10. Calculation of ∆wi

11. Observations Does the training technique support our intuition? • The larger the xi, larger is ∆wi • Error burden is borne by the weight values corresponding to large input values

12. Observations contd. • ∆wi is proportional to the departure from target • Saturation behaviour when o is 0 or 1 • If o < t, ∆wi > 0 and if o > t, ∆wi < 0 which is consistent with the Hebb’s law

13. Hebb’s law nj wji • If nj and ni are both in excitatory state (+1) • Then the change in weight must be such that it enhances the excitation • The change is proportional to both the levels of excitation ∆wji is prop. to e(nj) e(ni) • If ni and nj are in a mutual state of inhibition ( one is +1 and the other is -1), • Then the change in weight is such that the inhibition is enhanced (change in weight is negative) ni

14. Saturation behavior • The algorithm is iterative and incremental • If the weight values or number of input values is very large, the output will be large, then the output will be in saturation region. • The weight values hardly change in the saturation region

15. Backpropagation algorithm …. Output layer (m o/p neurons) j • Fully connected feed forward network • Pure FF network (no jumping of connections over layers) wji …. i Hidden layers …. …. Input layer (n i/p neurons)

16. Gradient Descent Equations

17. Example - Character Recognition • Output layer – 26 neurons (all capital) • First output neuron has the responsibility of detecting all forms of ‘A’ • Centralized representation of outputs • In distributed representations, all output neurons participate in output

18. Backpropagation – for outermost layer

19. Backpropagation for hidden layers …. Output layer (m o/p neurons) k …. j Hidden layers …. i …. Input layer (n i/p neurons) kis propagated backwards to find value of j

20. Backpropagation – for hidden layers

21. General Backpropagation Rule • General weight updating rule: • Where for outermost layer for hidden layers

22. Issues in the training algorithm • Algorithm is greedy. It always changes weight such that E reduces. • The algorithm may get stuck up in a local minimum. • If we observe that E is not getting reduced anymore, the following may be the reasons:

23. Issues in the training algorithm contd. • Stuck in local minimum. • Network paralysis. (High –ve or +ve i/p makes neurons to saturate.) • (learning rate) is too small.

24. Diagnostics in action(1) 1) If stuck in local minimum, try the following: • Re-initializing the weight vector. • Increase the learning rate. • Introduce more neurons in the hidden layer.

25. Diagnostics in action (1) contd. 2) If it is network paralysis, then increase the number of neurons in the hidden layer. • Problem: How to configure the hidden layer ? • Known: One hidden layer seems to be sufficient. [Kolmogorov (1960’s)]

26. Diagnostics in action(2) Kolgomorov statement: A feedforward network with three layers (input, output and hidden) with appropriate I/O relation that can vary from neuron to neuron is sufficient to compute any function. • More hidden layers reduce the size of individual layers.

27. Diagnostics in action(3) 3) Observe the outputs: If they are close to 0 or 1, try the following: • Scale the inputs or divide by a normalizing factor. • Change the shape and size of the sigmoid.

28. Diagnostics in action(3) • Introduce momentum factor. • Accelerates the movement out of the trough. • Dampens oscillation inside the trough. • Choosing : If is large, we may jump over the minimum.

29. An application in Medical Domain

30. Expert System for Skin Diseases Diagnosis • Bumpiness and scaliness of skin • Mostly for symptom gathering and for developing diagnosis skills • Not replacing doctor’s diagnosis

31. Architecture of the FF NN • 96-20-10 • 96 input neurons, 20 hidden layer neurons, 10 output neurons • Inputs: skin disease symptoms and their parameters • Location, distribution, shape, arrangement, pattern, number of lesions, presence of an active norder, amount of scale, elevation of papuls, color, altered pigmentation, itching, pustules, lymphadenopathy, palmer thickening, results of microscopic examination, presence of herald pathc, result of dermatology test called KOH

32. Output • 10 neurons indicative of the diseases: • psoriasis, pityriasis rubra pilaris, lichen planus, pityriasis rosea, tinea versicolor, dermatophytosis, cutaneous T-cell lymphoma, secondery syphilis, chronic contact dermatitis, soberrheic dermatitis

33. Training data • Input specs of 10 model diseases from 250 patients • 0.5 is some specific symptom value is not knoiwn • Trained using standard error backpropagation algorithm

34. Testing • Previously unused symptom and disease data of 99 patients • Result: • Correct diagnosis achieved for 70% of papulosquamous group skin diseases • Success rate above 80% for the remaining diseases except for psoriasis • psoriasis diagnosed correctly only in 30% of the cases • Psoriasis resembles other diseases within the papulosquamous group of diseases, and is somewhat difficult even for specialists to recognise.

35. Explanation capability • Rule based systems reveal the explicit path of reasoning through the textual statements • Connectionist expert systems reach conclusions through complex, non linear and simultaneous interaction of many units • Analysing the effect of a single input or a single group of inputs would be difficult and would yield incor6rect results

36. Explanation contd. • The hidden layer re-represents the data • Outputs of hidden neurons are neither symtoms nor decisions

37. Symptoms & parameters Duration of lesions : weeks Internal representation 0 Disease diagnosis Duration of lesions : weeks 0 1 1.58 Minimal itching 0 ( Psoriasis node ) -2.68 -3.46 1.22 6 -2.48 Positive KOH test 1.68 10 2.13 13 -2.86 1.43 5 (Dermatophytosis node) -2.71 Lesions located on feet 1.62 -3.31 36 1.46 14 Minimal increase in pigmentation 71 1 Positive test for pseudohyphae And spores 9 (Seborrheic dermatitis node) 95 19 Bias Bias 20 96 Figure : Explanation of dermatophytosis diagnosis using the DESKNET expert system.

38. Discussion • Symptoms and parameters contributing to the diagnosis found from the n/w • Standard deviation, mean and other tests of significance used to arrive at the importance of contributing parameters • The n/w acts as apprentice to the expert