CS 5541 Study Questions and Homework 4
Homework (15 points) due Wednesday, November 19, 2003.
For this Homework, turn in your answers for the following study questions:
Q7 (2 pts)
Q9 (3 pts)
Q12 (2 pts)
Q14 (3 pts)
Q32 (2 pts)
Q34 (3 pts)
- Is the SAIL robotic system an example of supervised or unsupervised learning?
Explain your answer.
- What kinds of generalization might you expect from the SAIL system?
- Give a diagram of a biological neuron, naming the following neuron parts:
soma, axon, dendritic tree, synapses.
- Do ANN's model 'a' brain or 'the' brain? Explain your answer.
- Give two aspects of biological neuron that an ANN models.
- Give two aspects of a biological neuron that an ANN does not model.
- Excitatory synapses work by increasing the potential of a downstream neuron
to fire. Inhibitory synapses work by decreasing the potential of a downstream
neuron to fire. Explain how excitatation and inhibition such as this might
be modeled using an ANN unit.
- Draw a fully connected feedforward ANN with three input units, one hidden
unit, and two output units.
- Using the sigmodal activation function with sigma=1, for the following neural
give the outputs of the network with the following weights and inputs.
What problem does the network (approximately) solve?
- We call neural networks such as that above function approximators.
- For the ANN in problem 9, how might this neural net exhibit generalization?
- What is a step activation function? Give an example.
- Use a spreadsheet to generate sigmoidal curves for sigma=5, 15, 25
- Let A2 = f(W1 * A1), and let A3 = f(W2 * A2), where f(X) is an activation
function operating individually on elements of matrices. If W1 is a 5x3 matrix,
and A1 is a 3x1 matrix, and W2 is a 4x5 matrix, give a diagram of the feedforward
network represented by these operations. What is another name for A1? What
is another name for A2? For A3? How many outputs does the ANN have? How many
inputs does it have? How many hidden units?
- Is a self-organizing map (a) supervised, or (b) unsupervised? Explain.
- Draw a diagram in terms of neural units, and connection weights for the
general self-organizing map (SOM) architecture.
- A given SOM has 3 inputs and two outputs. Draw the architecture of the SOM.
- How many categories can the SOM in question #17 represent?
- How do we test for generalization in a SOM?
- In the algorithm for training (establishing) the weights in a SOM, before
the weight update rule can be applied, what is done?
- Give the weight update rule for the SOM algorithm. Make sure to explain
- For a SOM with three inputs and two outputs, one input data sample is: (1,
1, 0). Assuming the weight vectors are (.5 .2 .3) for unit 1 in the output,
and (.8 .9 0) for unit 2 in the output, compute the weight update for that
- For a SOM with four inputs and two outputs, and weight vector (0 0 .5 1.0)
for output unit 1, and (1.0 .5 0 0) for output unit 2, what category does
the input vector: (0 1 0 0) fall into?
- On what basis do SOMs achieve categorization?
- Give a Scheme language expression that will return the first element of
a list, given the list.
- What does (cdr '(1 2 3)) evaluate to in Scheme?
- What does 'abc evaluate to in Scheme?
- What does (equal? (+ 1 2) (+ 2 1)) evaluate to in Scheme?
- What does (equal? '(+ 1 2) '(+ 2 1)) evaluate to in Scheme?
- What does (member 'b '(a b c)) evaluate to in Scheme?
- What is the difference between the list function and the append
function in Scheme?
- Define a Scheme function (using define and lambda), named last,
that returns the last element of a list, given the list as the parameter of
the function.If you find iteration is necessary, use only recursion as your
means of iteration. Don't use global variables.
- Define a Scheme function (using define and lambda), named reverse,
that reverses the elements of a list, given the list as the parameter of the
function. Don't use the built-in Scheme function that reverses lists. An example
of calling this function is: (reverse '(a b c)) ==> (c b a). Use only recursion
as your means of iteration. Don't use global variables.
- In Scheme, write a recursive function for set union. Your function should
take two parameters, S1 and S2, both sets, and return the union of the sets.
Remember that sets don't contain duplicates, and that sets are unordered.
Don't use global variables.
- In Scheme, write a recursive function for set intersection. Again, your
function should take two parameters, S1 and S2, both sets, this time returning
the intersection of the sets. Don't use global variables.