代做MATH3204/7234 (S2-2024): Assignment 04代写Python编程

MATH3204/7234 (S2-2024): Assignment 04

Due: 25-October-2024 @5:00pm

1. Logistic regression is an important binary classification technique in machine learning that builds off of the concepts of linear regression. Recall that in linear regression, there is a set of predictor variables (or features) ai ∈ R d , i = 1, . . . , n, with corresponding outcome variables bi ∈ R, i = 1, . . . , n and our aim is to fit a linear model to the data that minimizes a quadratic loss, namely

It can be easily seen that the solution to the above least-squares is the same as

where φ(t) = t 2/2. Logistic regression can be thought of as a modification of linear regression in two ways: first, the outcome variables are binary representing the two classes, i.e., bi ∈ {0, 1}, i = 1, . . . , n, and second, the least-squares loss is replaced with a logistic loss, i.e., φ(t) = ln (1 + e t ), where “ln” is natural logarithm. Logistic regression is thus the problems of finding the parameter x that minimizes this new loss (note that unlike linear regression, there is no closed form. solution for logistic regression and one has to resort to optimization algorithms). In machine learning, this phase is often referred to as “training”. After the training phase, we now have a way of classifying a new input, that is not part of your training data, i.e., predicting the label of an out-of-sample data. This phase in machine learning is often called “testing” or “generalization”. More specifically, using our trained logistic model and given any new data a, we can obtain the probability of a belonging to either class 0 or 1 as

(a) Derive the gradient and the Hessian matrix of f(x) in (1).               [10 Marks]

(b) Prove that f(x) is convex.                                                            [10 Marks]

(c) Write a Matlab or Python function that takes in three arguments: the parameter x ∈ R d , the matrix of features A ∈ R n×d and the vector of labels b ∈ R n defined as

and outputs f(x), ∇f(x) and the Hessian matrix ∇2 f(x). Call your function logisticFun(x,A,b). Note: In implementing your function, it is very useful to employ log-sum-exp trick for log-domain calculations. This will help avoid under-flow and overflow problems, which commonly occur in functions involving logarithm of sum of exponential functions.                [10 Marks]

(d) Test your derivations using the provided Matlab/Python code. The provided func-tion “derivativeTest” takes in a function handle “fun” and a point “x0”, and uses first and second-order Taylor exapnsions around “x0” to verify if the gradient or Hessian of “fun” are correct; see here and here for some explanation on function handles in Matlab and Python, respectively. The argument x0 is then fed into the function fun, which in turn is required to return three arguments: “f0, “g0”, and “H0”, which are respectively the function value, the gradient and Hessian of the function at x0. Recall from lectures that the error in approximations of f(x0+p) us-ing first and second order Taylor expansions around x0 should behave, respectively, as O(k pk 2 ) and O(k pk 3 ), i.e., when the p is halved, the error should respectively go down by a factor 1/4 and 1/8. Of course, if the gradient or Hessian is not correctly computed, the error will behave differently and goes down at slower rates. The code uses this principle to check your gradient and the Hessian matrix. The error lines corresponding to your function are plotted in “red”. These lines must be, for the most part, parallel to the lines of “Theoretical Order”, which are ploted in color “blue”. It is OK if some parts of the red lines at the beginning and/or at the end deviate from the blue lines (these are due to the fact that Taylor approximations are bad when p is large, and only get more accurate as p gets smaller until the round-off error takes over). However, the red lines must be parallel to the blue lines for a good portion in the middle.       [5 Marks]

You can use the following code to test your function

1   n =1000; d = 100;

2   A = randn (n , d ) ;

3   I = eye (2 ,1) ;

4   ind = randsample (2 ,n , true ) ; b = I ( ind , :) ;

5   derivativeTest ( @ ( x ) logisticFun (x ,A , b ) , ones (d ,1) ) ;

6

Listing 1: For Matlab, use the above code snippet.

1   n , d = 1000 , 50

2   A = rand . randn (n , d )

3   I = np . eye (2 , 1)

4   ind = rand . randint (2 , size = n )

5   b = I [ ind , :]

6   fun = lambda x : logisticFun (x ,A , b )

7   derivativeTest ( fun , np . ones (( d ,1) ) )

8

Listing 2: For Python use the above code snippet.

Explicitly forming the Hessian matrix of our logistic regression model f(x) requires O(nd2 ) in terms of computations and O(d 2 ) in storage (in addition to the unavoidable storage required for the data itself). These costs can be computationally prohibitive in large-scale problems when d, n >> 1. However, many optimization algorithms only require access to Hessian in the form. of Hessian-vector products and explicitly forming the Hessian matrix is not necessary.

(e) Modify your function so, instead of computing the explicit Hessian matrix, it re-turns a function handle, which given a vector v, computes Hessian-vector product, ∇2 f(x)v, without every explicitly forming Hessian. The cost of this matrix-vector product should be O(nd) with no additional storage requirements (Hint: To multi-ply the matrix zzT by a vector v for some z, v ∈ R d , we can either form. the matrix zzT first and then apply v to it, which will take O(d 2 ) both in computation and storage or re-order the computation to do z h z, vi , which will only take O(d) in computation and storage.)          [10 Marks]

(f) Test your Hessian-vector product function handle using the function derivativeTest. The code automatically checks and determines whether the matrix is explicitly formed or it is a function handle.         [5 Marks]

2. In this question, and in the context of the logistic regression problems, you will experiment with the following optimization methods:

– Gradient Descent with Armijo line-search,

– Newton-CG Method with Armijo line-search, and

– L-BFGS with strong Wolfe conditions.

Let us recall the e2-regularized logistic regression function

where λ > 0 is a given regularization parameter.

(a) Show that f(x) is strongly convex.                                               [10 Marks]

(b) Show that the gradient of f is Lg-Lipschitz continuous and             [10 Marks]

where k Ak is the spectral norm of the matrix A.

From Question 1, you should have a function called logisticFun(x,A,b) that takes in three arguments: the parameter x ∈ R d , the matrix of features A ∈ R n×d and the vector of 0/1 labels b ∈ R n , and outputs the function value, its gradient, and a function handle, which given a vector v, computes Hessian-vector product. Note: If you did not manage to get your code working properly for Question 1, we have included a function called “softMaxFun” (for both Matlab and Python), which implements a multi-class generalization of logistic regression, i.e., when you only have 0/1 labels, it is exactly logistic regression, but it can also handle more than binary labels. You can use it to implement your optimization algorithms for this question. The documentation for softMaxFun is self-explanatory. Just note that in softMaxFun’s definition, (x,A,b) are, respectively, denoted by (w,X,Y).

(c) Modify your function to account for the added ` 2-regularization term for a given λ. Check that your implementation is correct using the derivativeTest function from before.           [5 Marks]

(d) Implement the above three optimization methods. Set the history size of L-BFGS to 20. Set the parameters of Armijo and curvature conditions, respectively, to 10−4 and 0.9. Set the termination condition to be either k∇f(xk)k ≤ 10−4 or k > 1000. For solving the linear system within Newton-CG, terminate the CG iterations if either maximum iteration count of 100 is reached or the relative residual falls below 10−2 (you can use native CG function in Matlab or Python). For gradient descent, set the initial trial step-size of its line-search to α = 10/Lg using the upper-bound estimate on Lg from an earlier part of this question. For Newton-CG and L-BFGS, the best choice for the initial trial step size is always α = 1, which is often accepted in line-search. The attached MATLAB/Python code called lineSearchWolfeStrong implements the strong Wolfe conditions, which you can use in your implementation of L-BFGS.           [15 Marks (5 marks for each method)]

The function lineSearchWolfeStrong takes in a few arguments:

– objFun: A function handle to the objective function,

– xk, pk: current iterate and the current search direction, respectively,

– alpha0: initial trial step-size (which for L-BFGS is always 1),

– beta1, beta2: parameters of Armijo and curvature conditions,

– linesearchMaxItrs: maximum allowable number of line-search (set this to be, say, 1000).

The function lineSearchWolfeStrong also returns two outputs:

– alpha: the chosen step-size, and

– itrLS: the total of number of iterations of Wolfe line-search, which you can ignore.

For this question, we always initialize all optimization methods at x0 = 0, and set the regularization parameter λ = 1. You will test your code on a real data set, namely the spam classification data set from https://archive.ics.uci.edu/ml/datasets/ spambase. You are provided with a code that loads this data set in MATLAB or Python. Download the data folder spam and the file loadData. Calling loadData loads the spam data set, randomly splits it into a training set and a test set, and outputs

– A_train: the training matrix of features/attributes,

– b_train: the training vector of labels,

– A_test: the test matrix of features/attributes, and

– b_test: the test vector of labels.

Note that, depending on where you store the data and your code, you might have to change the argument of load(’../data/spam/spambase.data’) inside the function loadData to point to the location of the data on your machine. In a nutshell, each row of the training feature matrix A_train consists of “attributes” for a given document. The corresponding row of b_train is the label of that document as being spam (1) or not (0). Same correspondence holds in the test data set.

By fitting a logistic regression to this training data, we obtain a parametric decision rule, parameterized by x, that can be used to classify a new unlabeled document.

(e) Using our logistic regression model, write a function that given a document in the form. of a vector of features, a, and the parameter x, assigns a label to a. This can be done as follows: we first calculate the probability of a belonging to either class 0 or 1 as

The label of a is determined as the one that has a higher probability (ties are unlikely, but you can break them arbitrarily if you encounter them).        [5 Marks]

(f) Apply the above optimization methods to this logistic regression model using the training data A_train and b_train. Compare the performance of these three optimization methods by plotting the objective value, gradient norm, and the test accuracy (proportion of correct predictions using the test set A_test, b_test), as a function of iterations as well as “wall-clock” time. In total you should have 6 plots, namely objective value vs. iterations, gradient norm vs. iterations, test accuracy vs. iterations, objective value vs. time, gradient norm vs. time, test accuracy vs. time. Each plot should depict the performance of all three methods at once.          [5 Marks]

Bonus Question 01

3. Logistic regression is a convex classification model. But there are also non-convex al-ternatives. As a simple example, one can consider ` 2-regularized non-linear least squares based on sigmoid function as

where λ is a given regularization parameter. It is easy to see that if λ is not too large, the above problem is non-convex (of course, if λ is too large, then the problem can become convex). In this question, you will compare the performance of gradient descent, L-BFGS, and Gauss-Newton on the above model. Note that since the problem is no-longer strongly convex, vanilla Newton’s method can no longer be applied (though, there are a plethora of Newton-type methods that can be applied).

(a) Write a function that takes in three arguments: the parameter x ∈ R d , the ma-trix of features A ∈ R n×d and the vector of 0/1 labels b ∈ R n , and outputs f(x), ∇f(x) and a function handle, which given a vector v, computes matrix-vector product, G(x)v, where G is the Gauss-Newton matrix. Let’s call your function nlsFun(x,A,b).           [5 Marks]

(b) Test your gradient using the derivativeTest function from before. Note that, unfortunately, there is no easy way to test the correctness of the Gauss-Newton matrix and derivativeTest does not apply for this test.         [5 Marks]

(c) Implement the Gauss-Newton method with Armijo line-search and CG inner iter-ations. Use the same parameters as that for Newton-CG above.             [5 Marks]

One can show that the gradient of f is Lg-Lipschitz continuous and

So, for gradient descent, set the initial trial step-size of its line-search to α = 10/Lg using the above upper-bound estimate on Lg. For Gauss-Newton, like Newton-CG, again the best choice for the initial trial step size is α = 1, which is often accepted in line-search. All other parameters, e.g., termination criteria, line-search parameters, etc, are as in the previous question.

(d) Run your code on the spam data set by fitting the above non-linear least squares on the training data A_train and b_train. Compare the performance of gradient de-scent, L-BFGS and Gauss-Newton by plotting the same set of plots as the previous question.       [5 Marks]

Bonus Question 02

4. In the same setting as the one in Question 2, implement Nesterov’s accelerated gradi-ent descent algorithm, and compare its performance with the three methods considered in that question.             [10 Marks].

100 marks in total + 30 extra marks for the bonus questions

Note:

• This assignment counts for 15% of the total mark for the course.

• You don’t have to do the bonus questions, but they may help bring up your mark if you miss some points on other questions.

• Your mark for this assignment will be calculated as

min{Total marks obtained for all the questions, 100} × 0.15.

So with or without bonus, you can only get a maximum of 15%.

• Although not mandatory, if you could type up your work, e.g., LaTex, it would be greatly appreciated.

• Show all your work and attach your code and all the plots (if there is a programming question).

• Combine your solutions, all the additional files such as your code and numerical results, along with your coversheet, all in one single PDF file.

• Please submit your single PDF file on Blackboard.