Department of Electrical Engineering

Indian Institute of Technology, Kanpur

EE 671 Neural Networks Comprehensive Exam
27 April 2015 Duration 3 hours MM 90
Q1. The forward kinematics of a two-link planar robot is given as
x cos1 cos 2
y sin 1 sin 2

where 1 , 2 are link 1 and 2 angles with respect to the horizontal positive axis respectively. The
corresponding inverse kinematics is learned using a 2-D KSOM based network of a lattice size
1010 . For every KSOM neuron, the associated linear model is:

(u ) A (u w )
x
where u ; w is the cluster center of the th neuron.
y

a. Write network responses for coarse and fine actions. Derive weight update laws for
, A and w . [10 marks]
b. How many neurons will participate in the decision making process in the beginning?
How many neurons will participate when the training is complete? Why? [3 marks]
x 1.295
c. After training, u
is presented to the network to find out the
y 0.109

1
corresponding joint angle vector . The winning neuron cluster center for this
2
1.308
input is ww
. Determine ideal values for w ; Aw associated with this winning
0.108
neuron. Find the response and the corresponding state of the end-effector. [7 marks]
d. After a certain level of training, the parameters associated with the cluster center
0.707
0.9 0.9
1.6
w
are as follows: A
; . Find out the expected

1.2
0
0 .7
1.707

values of these parameters at this cluster center and comment on the learning status. [5
marks]

Q2. A Schroedinger wave equation based quantum neural network has a linear 1-D neural lattice
actuating the desired potential field. The network is expected to filter a dc signal embedded in 20
dB Gaussian noise.

a. Write the expression for V ( x ), i

d
and y for the above denoising network. Write the
dt

dK
; K W1 W2 .... Wn [8 marks]
dt
b. Write exact steps involved in the integration of the Schroedinger wave equation in the
closed form. Write an algorithm that will estimate the actual signal. [7 marks]

weight update law

Q3. Associative and Quantum Associative memory

a. A Hopfield network stores following patterns:
1
1
1
1
1
1

1 1; 2 1; 3 1
1
1
1

1
1
1
i.
Find W assuming wii 0. [4 marks]
ii.
iii.

Show that if all stored patterns are stable. [4 marks]

Which stored pattern will be retrieved when the network is presented with

T
x 1 1 1 1 1 . [2 marks]
b. An ensemble of n electrons is used to store p patterns.
i.
Write the algorithm for storing p patterns. [4 marks]
ii.
Write the algorithm for retrieving a stored pattern. [4 marks]

Q4. Draw the schematic of a deep neural network. [2 marks]

a. How is a deep network different from a multi-layered network? [1 mark]
b. Why can not you use back-propagation learning algorithm to train a deep network? How
is deep learning different from back-propagation. [2 marks]
c. Derive the weight update law using restricted Boltzmann machine. [8 marks]
Q5. Answer following questions.
a. Under what conditions following systems (machines) can exhibit cognitive behavior? [4
marks]
a controller
a language expert
b. Explain the principle of the gradient descent learning. [2 marks]
c. Find the operator that will convert the state of an n-cubit register in definitive all zero
states to the superposition of equi-probable all states. Illustrate using 2-qubit register. [4
marks]
d. Consider the recurrent network as shown below. Each neuron is linearly activated. Write
the response of this network. Obtain the weight update law using RTRL algorithm. [5
marks]

e. Show that network in Figure (a) is equivalent to the network in Figure (b). Note
that the output of each neuron is just the sum of all its inputs. Derive W3 in terms of W1
and W2 . [6 marks]

f. What tasks are machines good at doing that humans are not? What tasks are humans
good at doing that machines are not? [2 marks]
g. What is natural intelligence? When can you say that a machine is intelligent? [4 marks]