For the following assignments, please provide as much evidence of the results as possible, including the code, screenshots (only plots – not text or code) and documentation. Submit only one pdf file...

Please see instructions for this assignment in attached document


For the following assignments, please provide as much evidence of the results as possible, including the code, screenshots (only plots – not text or code) and documentation. Submit only one pdf file and .ipynb / .py files containing the code with documentation. 1.a. [10 points] We talked about a discriminator in GAN that can recognize real-life looking images. Is it possible to code the same functionality using the conventional / deductive programming paradigm? If yes, briefly describe the algorithm. If not, explain why not. How about the veracity of tweets application? 1.b. [15 points] Search for job descriptions which specifically ask for some of the Machine Learning terms listed on the syllabus sheet. Here's an example of one such search: https://www.linkedin.com/jobs/search?keywords=Random%20Forest Describe your top 5 takeaways / observations based on the search results. 2.a. [10 points] Feature Engineering: List out as many features as possible, that can help determine the veracity of the following · Web Page · Student Homework · News Item in a daily · Image on Instagram · Video on YouTube 2.b. [15 points] Consider an example of conventional programming solution that you coded in the past. Briefly describe the algorithm. Can we use the inductive programming approach of Machine Learning to solve it now? If so, is there any advantage to shifting to the Machine Learning approach? If not, explain why not. In that case, can you think of an application that is currently solved using conventional programming, which can benefit from Machine Learning techniques? Explain. 3. Follow the simple tutorial at https://towardsdatascience.com/simply-explained-logistic-regression-with-example-in-r-b919acb1d6b3 (Links to an external site.) to see Logistic Regression in action. Implement the same functionality for the same dataset in Python. Does the Python version result in the same predictions of test data as R? 4.a. [15 points] Sigmoid functions such as the logistic function played a major role during the discussion on Machine Learning for Veracity of the tweets. What are some of the other mathematical functions that can possibly take the place of the Sigmoid function and help with Machine Learning? Comment on their effectiveness. 4.b. [10 points] Apply the discussion that we had in the second class for classifying the truthfulness of tweets to another popular classification problem: spam detection. Describe the same briefly in your words. – 1 – Will Monroe CS 109 Lecture Notes #22 August 14, 2017 Logistic Regression Based on a chapter by Chris Piech Logistic regression is a classification algorithm1 that works by trying to learn a function that approximates P(Y |X ). It makes the central assumption that P(Y |X ) can be approximated as a sigmoid function applied to a linear combination of input features. It is particularly important to learn because logistic regression is the basic building block of artificial neural networks. Mathematically, for a single training data point (x, y), logistic regression assumes: P(Y = 1 | X = x) = σ(z) where z = θ0 + m∑ i=1 θi xi This assumption is often written in the equivalent forms: P(Y = 1 | X = x) = σ(θTx) where we always set x0 to be 1 P(Y = 0 | X = x) = 1 − σ(θTx) by total law of probability Using these equations for probability of Y | X we can create an algorithm that selects values of theta that maximize that probability for all data. I am first going to state the log probability function and partial derivatives with respect to theta. Then later we will (a) show an algorithm that can chose optimal values of theta and (b) show how the equations were derived. An important thing to realize is that: given the best values for the parameters (θ), logistic regression often can do a great job of estimating the probability of different class labels. However, given bad, or even random, values of θ it does a poor job. The amount of “intelligence” that your logistic regression machine learning algorithm has depends on how good its values of θ are. Notation Before we get started I want to make sure that we are all on the same page with respect to notation. In logistic regression, θ is a vector of parameters of length m and we are going to learn the values of those parameters based off of n training examples. The number of parameters should be equal to the number of features of each data point (see section 1). Two pieces of notation that we use often in logistic regression that you may not be familiar with: θTx = m∑ i=1 θi xi = θ1x1 + θ2x2 + · · · + θm xm σ(z) = 1 1 + e−z The superscript T in θTx represents a matrix transpose; the operation θTx is equivalent to taking the dot product of the vectors θ and x, or simply a weighted sum of the components of x (with θ containing the weights). 1Yes, this is a terribly confusing name, given that regression refers to tasks that require predicting continuous values. Perhaps logistic classification would have been better. – 2 – The function σ(z) = 11+e−z is called the logistic function (or sigmoid function); it looks like this: σ(z) z An important quality of this function is that it maps all real numbers to the range (0, 1). In logistic regression, σ(z) turns an arbitrary “score” z into a number between 0 and 1 that is interpreted as a probability. Positive numbers become high probabilities; negative numbers become low ones. Log Likelihood In order to chose values for the parameters of logistic regression, we use maximum likelihood estimation (MLE). As such we are going to have two steps: (1) write the log-likelihood function and (2) find the values of θ that maximize the log-likelihood function. The labels that we are predicting are binary, and the output of our logistic regression function is supposed to be the probability that the label is one. This means that we can (and should) interpret each label as a Bernoulli random variable: Y ∼ Ber(p) where p = σ(θTx). To start, here is a super slick way of writing the probability of one data point (recall this is the equation form of the probability mass function of a Bernoulli): P(Y = y |X = x) = σ(θTx)y · [ 1 − σ(θTx) ] (1−y) Now that we know the probability mass function, we can write the likelihood of all the data: L(θ) = n∏ i=1 P(Y = y(i) | X = x(i)) the likelihood of independent training labels = n∏ i=1 σ(θTx(i))y (i) · [ 1 − σ(θTx(i)) ] (1−y(i) ) substituting the likelihood of a Bernoulli And if you take the log of this function, you get the log likelihood for logistic regression. The log likelihood equation is: LL(θ) = n∑ i=1 y(i) logσ(θTx(i)) + (1 − y(i)) log[1 − σ(θTx(i))] Recall that in MLE the only remaining step is to chose parameters (θ) that maximize log likelihood. – 3 – Gradient of Log Likelihood Now that we have a function for log-likelihood, we simply need to chose the values of theta that maximize it. Unfortunately, if we try just setting the derivative equal to zero, we’ll quickly get frustrated: there’s no closed form for the maximum. However, we can find the best values of theta by using an optimization algorithm. The optimization algorithm we will use requires the partial derivative of log likelihood with respect to each parameter. First I am going to give you the partial derivative (so you can see how it is used); we’ll derive it a bit later: ∂LL(θ) ∂θ j = n∑ i=1 [ y(i) − σ(θTx(i)) ] x (i)j Gradient Ascent Optimization Our goal is to choosing parameters (θ) that maximize likelihood, and we know the partial derivative of log likelihood with respect to each parameter. We are ready for our optimization algorithm. In the case of logistic regression we can’t solve for θ mathematically. Instead we use a computer to chose θ. To do so we employ an algorithm called gradient ascent (a classic in optimization theory). The idea behind gradient ascent is that gradients point “uphill”. If you continuously take small steps in the direction of your gradient, you will eventually make it to a local maximum. In the case of logistic regression you can prove that the result will always be a global maximum. The update to our parameters that results in each small step can be calculated as: θ newj = θ old j + η · ∂LL(θ old) ∂θ oldj = θ oldj + η · n∑ i=1 [ y(i) − σ(θTx(i)) ] x (i)j Where η is the magnitude of the step size that we take. If you keep updating θ using the equation above, you will converge on the best values of θ. You now have an intelligent model. Here is the gradient ascent algorithm for logistic regression in pseudo-code: It is also common to have a parameter θ0 that is added as a constant to the θTx inside the sigmoid. Rather than computing special derivatives for θ0, we can simply define an additional feature x0 that always takes the value 1. Taking a weighted average then results in adding θ0, the weight for x0. – 4 – Derivations In this section we provide the mathematical derivations for the gradient of log-likelihood. The derivations are worth knowing because these ideas are heavily used in Artificial Neural Networks. Our goal is to calculate the derivative of the log likelihood with respect to each theta. To start, here is the definition for the derivative of a sigmoid function with respect to its inputs: ∂ ∂z σ(z) = σ(z)[1 − σ(z)] to get the derivative with respect to θ, use the chain rule Take a moment and appreciate the beauty of the derivative of the sigmoid function. The reason that sigmoid has such a simple derivative stems from the natural exponent in the sigmoid denominator. Since the likelihood function is a sum over all of the data, and in calculus the derivative of a sum is the sum of derivatives, we can focus on computing the derivative of one example. The gradient of theta is simply the sum of this term for each training data point. First I am going to show you how to compute the derivative the hard way. Then we are going to look at an easier method. The derivative of gradient for one data point (x, y): ∂LL(θ) ∂θ j = ∂ ∂θ j y logσ(θTx) + ∂ ∂θ j (1 − y) log[1 − σ(θTx] derivative of sum of terms = [ y σ(θTx) − 1 − y 1 − σ(θTx) ] ∂ ∂θ j σ(θTx) derivative of log f (x) = [ y σ(θTx) − 1 − y 1 − σ(θTx) ] σ(θTx)[1 − σ(θTx)]x j chain rule + derivative of σ = [ y − σ(θTx) σ(θTx)[1 − σ(θTx)] ] σ(θTx)[1 − σ(θTx)]x j algebraic manipulation = [ y − σ(θTx) ] x j cancelling terms Derivatives Without Tears That was the hard way. Logistic regression is the building block of artificial neural networks. If we want to scale up, we are going to have to get used to