BYU CS classes

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.
====Objective:====

To gaze in awe at the power and speed of automatic differentiation, and to wonder why it took us all so long to figure this out.

----
====Deliverable:====

Tidings of joy: this should be a super simple lab!

For this lab, you will modify your code from lab3.  You will swap out the numerical gradient, and you will swap in the true gradient which will be calculated via automatic differentiation.

To accomplish this, you'll use the ''autograd'' package.  Other than that, the lab specs look exactly the same as lab3.  They are repeated here for convenience, but just to emphasize: **you should only have to change about 3 lines of code in your lab to get this to work.**

You should turn in an iPython notebook that implements vanilla gradient descent on a 10-way CIFAR classifier.  You should load the CIFAR-10 dataset, create a linear score function, and use the log soft-max loss function.

To optimize the parameters, you should use vanilla gradient descent.

To calculate the gradients, you should use <del>numerical differentiation</del> **automatic differentiation**.  

Your code should be fully vectorized.  There should only be two ''for'' loops in your code: one that iterates over steps in the gradient descent algorithm, and one that loops over parameters to compute numerical gradients.

Your notebook should display two plots: classification accuracy over time, and the loss function over time.  **Please cleanly label your axes!**

Example plots are shown at the right.  Note that we're now running for 2000 epochs.

{{ :cs501r_f2016:lab4_cacc.png?direct&200|}}

{{ :cs501r_f2016:lab4_cost_function.png?direct&200|}}

The CIFAR-10 dataset can be downloaded at
[[https://www.cs.toronto.edu/~kriz/cifar.html|https://www.cs.toronto.edu/~kriz/cifar.html]]

**Note: make sure to download the python version of the data - it will simplify your life!**

----
====Grading standards:====

Your notebook will be graded on the following:

  * 80% Correct usage of automatic differentiation
  * 10% Tidy and legible visualization of cost function
  * 10% Tidy and legible plot of classification accuracy over time

----
====Description:====

You have now coded up a basic vanilla gradient descent optimizer, and you have calculated gradients using numerical differentiation.  But you may have noticed that it is horribly, painfully slow.  And the gradients you get out aren't actually that precise, anyway!

For this lab, you will change out one function: instead of calculating numerical gradients, you will use the ''autograd'' package, which will automatically calculate gradients for you.  To install autograd, just run the following command (make sure you're running the ''pip'' that comes with your anaconda installation!):

<code bash>
pip install autograd
</code>

**Very important note:** You'll need to change the way you import numpy.  The first two lines of your program **must** be the following:

<code python>
import autograd.numpy as np
from autograd import grad
</code>

You can find documentation on autograd here:

[[https://github.com/HIPS/autograd|Autograd]]

So, you'll need to use the ''grad'' function from the ''autograd'' package to automatically derive a new function (let's call it ''grad_f''), which when called will give you the gradients.

So, all you should have to do is swap out the call to ''numerical_gradient'' below, and swap in a call to ''grad_f''.  Note that ''grad_f'' will only return the gradients, not the actual value of the loss function, so you'll need to also call your loss function to compute the loss (which you'll need to generate the necessary plots):

<code python>
step_size = 0.1
for i in range(0,NUM_EPOCHS):
    loss_function_value = loss_function( W )
    grad = grad_f( W )
    W = W - step_size * grad
</code>


**Additional notes:**

Because automatic differentiation is so much faster, we don't need to project down into a small-dimensional feature space.  **Please eliminate the code that randomly projects the data down into a 10-dimensional space.**  That means that your ''W'' matrix will also change -- instead of being 10x10, it will now be 10x3072.  This also means that you should be able to get higher classification accuracy!

You should run your code for 2000 epochs.

You should plot both the loss function and the classification accuracy.

----
====Extra awesomeness:====

Now that you have a powerful automatic differentiation engine at your command, how hard would it be to take our simple linear scoring function, and change it to something more complex?  For example, could you swap in a simple 2-layer neural network?  Or something else entirely?

Since this lab is so short, you should have some extra time to play around.  I invite you to try something!

----
====Hints:====

You may want to test the automatic differentiation package on known test cases - for example, f(x)=x^2.

If your code seems to take forever to get running, seems to stall right at the beginning, or you get an error like ''FloatNode has no attribute named 'exp' '', make sure you're using the autograd version of numpy!

<code python>
import autograd.numpy as np
</code>
BYU CS classes

User Tools

Site Tools

Page Tools
