Lecture 13: Intro to Machine Learning

Lecture 13: Intro to Machine Learning

CS 179: LECTURE 15 INTRODUCTION TO CUDNN (CUDA DEEP NEURAL NETS) LAST TIME We derived the minibatch stochastic gradient descent algorithm for neural networks, i.e. Mostly matrix multiplications to compute One other derivative,

cuBLAS (Basic Linear Algebra Subroutines) already does matrix multiplications for us cuDNN will take care of these other derivatives for us TODAY Using cuDNN to do deep neural networks SETTING UP CUDNN cudnnHandle_t

Like cuBLAS, you need to maintain cuDNN library context Call cudnnCreate(cudnnHandle_t *handle) to initialize the context Call cudnnDestroy(cudnnHandle_t handle) to clean up the context HANDLING ERRORS Almost every function we will talk about today

returns a cudnnStatus_t (an enum saying whether a cuDNN call was successful or how it failed) Like standard CUDA, we will provide you with a checkCUDNN(cudnnStatus_t status) wrapper function that parses any error statuses for you Make sure you wrap every function call with this function so you know where and how your code breaks! REMINDERS ABOUT CUDA

Pattern of allocate initialize free (reiterate here for students who may not be as comfortable with C++) DATA REPRESENTATION cudnnTensor_t For the purposes of cuDNN (and much of machine learning), a tensor is just a multidimensional array A wrapper around a flattened 3-8 dimensional

array Used to represent minibatches of data For now, we will be using flattened 4D arrays to represent each minibatch X DATA REPRESENTATION cudnnTensor_t Consider the case where each individual training example is just a vector (so the last two axes will have size each)

Then X[n,c,0,0] is the value of component c of example n If axis has size size, then X[n,c,h,w] (pseudocode) is actually X[n*size0*size1*size2 + c*size0*size1 + h*size0 + w] DATA REPRESENTATION cudnnTensor_t More generally, a single training example may

itself be a matrix or a tensor. For example, in a minibatch of RGB images, we may have X[n,c,h,w], where n is the index of an image in the minibatch, c is the channel (R = , G = , B = ), and h and w index a pixel (h, w) in the image (h and w are height and width) DATA REPRESENTATION cudnnTensorDescriptor_t

Allocate by calling cudnnCreateTensorDescriptor( cudnnTensorDescriptor_t *desc) The ordering of array axes is defined by an enum called a cudnnTensorFormat_t (since we are indexing as X[n,c,h,w], we will use CUDNN_TENSOR_NCHW) A cudnnDataType_t specifies the data type of the tensor (we will use CUDNN_DATA_FLOAT)

DATA REPRESENTATION cudnnTensorDescriptor_t Initialize by calling cudnnSetTensor4dDescriptor( cudnnTensorDes criptor_t desc, cudnnTensorFormat_t format, cudnnDataType_t dataType, int n, int c, int h, int w) Free by calling cudnnDestroyTensorDescriptor( cudnnTensorD escriptor_t desc)

DATA REPRESENTATION cudnnTensorDescriptor_t Get the contents by calling cudnnGetTensor4dDescriptor( cudnnTensorDescriptor _t desc, cudnnDataType_t dataType, int *n, int *c, int *h, int *w, int *nStr, int *cStr, int *hStr, int *wStr) Standard trick of returning by setting output parameters Dont worry about the strides nStr, cStr, hStr, wStr

RELATION TO ASSIGNMENT 5 Forward pass (Algorithm) For each minibatch of training examples (Each example and its label are a column in matrices and respectively) For each counting up from to Compute matrix Compute matrix Our models prediction is

RELATION TO ASSIGNMENT 5 Forward pass (Implementation) Calculate the expected sizes of the inputs and outputs of each layer and allocate arrays of the appropriate size Input has shape Weight matrix has shape Outputs and have shape

Initialize tensor descriptors for each and RELATION TO ASSIGNMENT 5 Forward pass (Implementation) Note that cuBLAS puts matrices in column-major order, so and will be tensors of shape In this assignment, the skeleton code we provide will handle the bias terms for you (this is the extra term that weve been carrying in this whole time)

Just remember that when we write , we are implicitly including this bias term! RELATION TO ASSIGNMENT 5 Backward pass (Algorithm) Initialize gradient matrix For each counting down from to Calculate Calculate for each

and Update RELATION TO ASSIGNMENT 5 Backward pass (Implementation) Each matrix has the same shape as the input to its corresponding layer, i.e. Have each share a tensor descriptor with its corresponding Update each using cuBLASs GEMM

cuDNN needs the associated tensor descriptor when applying the derivative of the activation/nonlinearity ACTIVATION FUNCTIONS cudnnActivationDescriptor_t Allocate with cudnnCreateActivationDescriptor( cudnnActiv ationDescriptor_t *desc) Destroy with cudnnDestroyActivationDescriptor( cudnnActi vationDescriptor_t desc)

ACTIVATION FUNCTIONS cudnnActivationMode_t An enum that specifies the type of activation we should apply after any given layer Specify as CUDNN_ACTIVATION_ can be SIGMOID, RELU, TANH, CLIPPED_RELU, or ELU (the last 2 are fancier activations that address some of the issues with ReLU); use RELU for this assignment

ACTIVATION FUNCTIONS Graphs of activations as a reminder ACTIVATION FUNCTIONS cudnnNanPropagation_t An enum that specifies whether to propagate NANs Use CUDNN_PROPAGATE_NAN for this assignment ACTIVATION FUNCTIONS cudnnActivationDescriptor_t

Set with cudnnSetActivationDescriptor( cudnnActivati onDescriptor_t desc, cudnnActivationMode_t mode, cudnnNanPropagation_t reluNanOpt, double coef) coef is relevant only for clipped ReLU and ELU activations, so just use 0.0 for this assignment ACTIVATION FUNCTIONS cudnnActivationDescriptor_t Get contents with cudnnGetActivationDescriptor( cudnnActivatio

nDescriptor_t desc, cudnnActivationMode_t *mode, cudnnNanPropagation_t *reluNanOpt, double *coef) coef is relevant only for clipped ReLU and ELU activations, so just give it a reference to a double for throwaway values ACTIVATION FUNCTIONS Forward pass for an activation Computes tensor x = alpha[0] * (z) + beta[0] * x Note: numeric * means element-wise multiplication

cudnnActivationForward( cudnnHandle_t handle, cudnnActivationDescriptor_t activationDesc, void *alpha, cudnnTensorDescriptor_t zDesc, void *z, void *beta, cudnnTensorDescriptor_t xDesc, void *x) ACTIVATION FUNCTIONS Backward pass for an activation Computes dz = alpha[0] * (z) * dx + beta[0] * dz

cudnnActivationBackward( cudnnHandle_t handle, cudnnActivationDescriptor_t activationDesc, void *alpha, cudnnTensorDescriptor_t xDesc, void *x, cudnnTensorDescriptor_t dxDesc, void *dx, void *beta, cudnnTensorDescriptor_t zDesc, void *z, cudnnTensorDescriptor_t dzDesc, void *dz) ACTIVATION FUNCTIONS

Backward pass for an activation Computes dz = alpha[0] * (z) * dx + beta[0] * dz These are element-wise products, not matrix products! x: output of the activation, dx: derivative wrt x, z: input to the activation, dz: tensor to accumulate as output SOFTMAX/CROSS-ENTROPY LOSS

Consider a single training example transformed as The softmax function is The cross-entropy loss is Gives us a notion of how good our classifier is SOFTMAX/CROSS-ENTROPY LOSS Forward pass Computes tensor x = alpha[0] * softmax(z) + beta[0] * x

cudnnSoftmaxForward(cudnnHandle_t handle, cudnnSoftmaxAlgorithm_t alg, cudnnSoftmaxMode_t mode, void *alpha, cudnnTensorDescriptor_t zDesc, void *z, void *beta, cudnnTensorDescriptor_t xDesc, void *x) SOFTMAX/CROSS-ENTROPY LOSS cudnnSoftmaxAlgorithm_t Enum that specifies how to do compute the

softmax Use CUDNN_SOFTMAX_ACCURATE for this class (scales everything by to avoid overflow) The other options are CUDNN_SOFTMAX_FAST (less numerically stable) and CUDNN_SOFTMAX_LOG (computes the natural log of the softmax function) SOFTMAX/CROSS-ENTROPY LOSS

cudnnSoftmaxMode_t Enum that specifies over which data to compute the softmax CUDNN_SOFTMAX_MODE_INSTANCE does it over the entire input (sum over all c, h, w for a single n in X[n,c,h,w]) CUDNN_SOFTMAX_MODE_CHANNEL does it over each channel (sum over all c for each n, h, w triple in X[n,c,h,w])

Since h and w are both size here, either is fine to use SOFTMAX/CROSS-ENTROPY LOSS Backward pass cuDNN has a built-in function to compute the gradient of the softmax activation on its own However, when coupled with the cross-entropy loss, we get the following gradient wrt :

This is easier and faster to compute manually! Therefore, you will implement the kernel for this yourself SOFTMAX WITH OTHER LOSSES Backward pass For different losses, use the following function: cudnnSoftmaxBackward(cudnnHandle_t handle, cudnnSoftmaxAlgorithm_t alg, cudnnSoftmaxMode_t mode,

void *alpha, cudnnTensorDescriptor_t xDesc, void *x, cudnnTensorDescriptor_t dxDesc, void *dx, void *beta, cudnnTensorDescriptor_t dzDesc, void *dz) SOFTMAX WITH OTHER LOSSES Backward pass As with other backwards functions in cuDNN, this function computes the tensor dz = alpha[0] * (z) + beta[0] * dz

x is the output of the softmax function and dx is the derivative of our loss function wrt x (cuDNN uses them internally) Note that unlike backwards activations, we dont need a z input parameter (where z is the input to the softmax function) SUMMARY Defining data in terms of tensors

Using those tensors as arguments to cuDNNs built-in functions for both the forwards and backwards passes through a neural network You can find more details about everything we discussed in NVIDIAs official cuDNN developer guide Next week: convolutional neural nets

Recently Viewed Presentations

  • British Council-EAQUALS CEFR Core Inventory (English) Brian North

    British Council-EAQUALS CEFR Core Inventory (English) Brian North

    British Council-EAQUALS CEFR Core Inventory (English) Brian North (EAQUALS) Susan Sheehan (British Council) CEFR Core Inventory Aims Development Sources Documentation of best practice Use Outcomes Products Aims To make the CEFR tangible and provide support and guidance for teachers and...
  • The Implementation and Application of CORAL

    The Implementation and Application of CORAL

    The Implementation and Application of CORAL: an open source ERM system. Jia Mi. Yongming Wang. VALE 2012 Annual Users' Conference. January 5, 2012
  • Prohibition in the 1920's - PBworks

    Prohibition in the 1920's - PBworks

    Prohibition laws were controlled provincially during the early 1900's . They were known as Provincial Temperance Acts. Most were maintained until shortly after the First World War-Wartime Ban of alcohol was lifted in 1919- most provinces(not Quebec) were still under...
  • Brainstorming for a Research Topic

    Brainstorming for a Research Topic

    There are 3 categories that are successful Career interest Hobby interest Social issues Career interest Make a list… List at least 3 careers that you might be interested in and for each career, in 1-2 sentences explain what you find...
  • Fiddler Web Debugger - Mehdi Khalili

    Fiddler Web Debugger - Mehdi Khalili

    Fiddler can decrypt HTTPS traffic using the Man-In-The-Middle attack. Client. Server. 1. 4. 2. 3. MITM. Setting up HTTPS decryption. Demo. Changing the traffic on the fly. You can set breakpoints and change the request and/or response on the fly....
  • STAPHYLOCOCCUS - WordPress.com

    STAPHYLOCOCCUS - WordPress.com

    Tumbuh pd hampirsemua media (nutrien, media agar darahdll) Meragikarbohidrat asamlaktat. Katalase. pos. Tahanterhadapkekeringan, panas(50 ⁰ C, 30 mnt, Na Cl 9%
  • Responsible Driving

    Responsible Driving

    Driving while impaired. In 2002, some 41 percent of 42,815 death occurred in alcohol crashes. One in every 122 licensed drivers (1.5 million) is arrested for driving while under the influence of alcohol, commonly called a DWI or DUI.
  • JDBC - Database Drivers

    JDBC - Database Drivers

    SQLLite and Java CS-328 Dick Steflik SQLLite Embedded RDBMS ACID Compliant Size - about 257 Kbytes Not a client/server architecture Accessed via function calls from the application Writing (insert, update, delete) locks the database, queries can be done in parallel...