Chris Pollett > CS256
( Print View )

Student Corner:
  [
Submit Sec1]
  [Grades Sec1]

  [Lecture Notes]

  [Discussion Board]

Course Info:
  [Texts & Links]
  [Topics/Outcomes]
  [Outcomes Matrix]
  [Grading]
  [HW/Quiz Info]
  [Exam Info]
  [Regrades]
  [Honesty]
  [Additional Policies]
  [Announcements]

HWs and Quizzes:
  [Hw1]  [Hw2]  [Hw3]
  [Hw4]  [Hw5]  [Quizzes]

Practice Exams:
  [Mid 1]  [Mid 2]  [Final]

                           












HW#1 --- last modified Friday, 29-Sep-2017 17:12:58 PDT.

Solution set.

Due date: Sep 20

Files to be submitted:
  Hw1.zip

Purpose: To gain experience with Python and our first neural net learning algorithms.

Related Course Outcomes:

The main course outcomes covered by this assignment are:

CLO1 -- Be able to code without a library a single perceptron training algorithm.

CLO2 -- Be able to predict the effect of different activation functions on the ability of a network to learn.

CLO3 -- Be able to explain how different neural network training algorithms work.

Specification:

For this homework you will create a Python implementation of a Perceptron together with an implementation of a couple Perceptron training algorithms. You will conduct some experiments to see if they confirm or deny what we learned about the Perceptron's ability to PAC-learn various functions.

Here are some specific requirements of your program and your experiments:

  1. Your program should run on a recent Mac Book Pro running Python 2.7.13 (the set-up where it will be graded). It should follow PEP 8 Coding Guidelines, and be split into reasonable functions. All the files needed to run your code as well as your experiment results should be put into the Hw1.zip file you submit. There should be a readme.txt in this ZIP file that let's me know who was on your team and anything else important about your code. If your code is written under Windows or Linux, it should work on a Mac without you having to do anything special, but it wouldn't hurt to check. Be aware you should not use any features of Python 3.x that are not in Python 2.7.x.
  2. Your program should run without any additional, non-default libraries installed (you can use re for regular expressions). For this HW, I want you to code pretty much from scratch. Do not assume I have Numpy or a neural net library.
  3. Your program should run from the command line and understand the parameters:
    python perceptron.py activation training_alg ground_file distribution num_train num_test epsilon
    
    Below is a concrete example of filling in the parameters in this line:
    python perceptron.py relu perceptron my_nested_bool_fn.txt bool 500 250 0.2
    
  4. Your program should use the activation command line argument to determine the activation function used by your perceptron. Your program should accept and implement the possibilities: threshold (by this I mean a step function), tanh (use either tanh or logistic function), and relu.
  5. Your program should use the training_alg command line argument to determine the training algorithm used by your perceptron. Your program should accept the possibilities: perceptron and winnow. The choice should correspond to using either the perceptron or winnow update rule from class.
  6. Your program should use the ground_file command line argument to read in and parse a ground function from the file of the given name. If the file is not parseable, it should just output "NOT PARSEABLE" and stop. Your program should be able to parse two formats for ground_file: nested boolean function and threshold function. A file containing a nested boolean function looks like (where the second line is a regex):
    NBF
    ([+|-]\d+(\s+(:?AND|OR)\s+\d+)*)?
    
    For example,
    NBF
    +1 OR -2 AND +5 AND +3
    
    which represents the boolean function on five inputs `f(x_1, x_2, x_3, x_4, x_5) := (((x_1 vv neg x_2) ^^ x_5) ^^ x_3)`. If the line after NBF is empty, we view it as the always 0 function. A file containing a threshold function looks like (where the second and third line are regex):
    TF
    [+|-]\d+
    ([+|-]\d+(\s+[+|-]\d+)*)?
    
    For example,
    TF
    +15
    +10 -5 +30
    
    which represents the function `f:RR^3 -> {0, 1}` given by `f(x_1, x_2,x_3) = 1` if and only `10x_1 - 5x_2 +30x_3 \geq 15`.
  7. Your program should use the distribution command line argument to determine the distribution that your training and test examples are drawn from. Your program should recognize the values bool for the uniform boolean distribution and sphere, for the uniform unit spherical distribution. In the case where the input file is a nested boolean function, this argument should be ignored and the uniform boolean distribution should be used. To generate an element from one of these distributions, one should first determine the number `n` of inputs to the ground function. For the uniform boolean distribution, your program should use `n` calls to random.randint(0, 1) to generate an `n`-bit vector. For the uniform unit spherical distribution, your program should use `n` calls to random.random() to generate an `n`-dimensional floating point vector and then normalize the result into a unit vector.
  8. Your program should use the num_train, num_test, and epsilon command line arguments as follows: First, it should generate num_train many examples according to the current command line distribution and the ground function on the inputs. For each example generated, it should train according to that example and the training algorithm, then output to stdout a line in the format:
    x1,x2,...,xn:y:[update|no update]\n
    
    For example, if the weights did not change when training on the input-output example `([1, 1, 0, 0], 1)` then your program should output:
    1,1,0,0:1:no update
    
    Once your program has completed training, it should compute num_test many test inputs, `vec{x}`, according to the current command line distribution and the ground function on the inputs. For each test, it should compute and output:
    x1,x2,...,xn:y_pred:y_actual:error\n
    
    Here `y_{pred}` is what the trained perceptron would compute on `vec{x}`, `y_{actual}` is when the ground function outputs on `\vec{x}`, and error is `|y_{pred}-y_{actual}|`. For example, if the test vector was `[1,0,1,1]` and the prediction of the perceptron on this input was 1 and this was also the ground function's value, then the line would look like:
    1,0,1,1:1:1:0
    
    After the last line output because of test data, you should compute the average error on the test data, output it followed by a line with the value of epsilon, followed by a line which either says "TRAINING SUCCEEDED" or "TRAINING FAILED" depending on whether the average was less than epsilon. Below is an example of how this might look:
    Average Error:0.19
    Epsilon:0.2
    TRAINING SUCCEEDED
    
  9. You should design and carry out experiments to see how well the Perceptron update rule lets you learn a nested boolean formula or a linear threshold function under the uniform boolean or uniform unit spherical distributions. For spherical distributions only test with respect to linear threshold function learning. In the perceptron update rule, uniform boolean distribution case in particular, do your experiments jive with our PAC learning results from class? You should describe your experiments in the file Experiments1.txt, and all the experimental runs you did for it should be in an Runs1 subfolder of your Hw1.zip file.
  10. You should design and carry out experiments to see how well the Winnow rule lets you learn a linear threshold function under the uniform unit spherical distribution under different choice of activation function. You should describe your experiments in the file Experiments2.txt, and all the experimental runs you did for it should be in an Runs2 subfolder of your Hw1.zip file.

Point Breakdown

Items 1-10 above are each with 1pt, graded on a (0 - insufficiently done, 0.5 - partially done, 1 - completely done) scale. 10pt
Total10pts