Scribd
Upload
346 views27 pages

Edx Mit Midterm Exam

The document contains the text of exam questions about linear perceptron algorithms. The first question asks the learner to determine the offset parameter theta_0 and parameter vector theta that would result from running the linear perceptron algorithm on the given data points, initialized to zero, until convergence. The second question asks if the point (5,2), labeled +1, could have been the first point considered by the algorithm, given the number of mistakes shown for each point.

Uploaded by

Prashanth R
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
346 views27 pages

Edx Mit Midterm Exam

The document contains the text of exam questions about linear perceptron algorithms. The first question asks the learner to determine the offset parameter theta_0 and parameter vector theta that would result from running the linear perceptron algorithm on the given data points, initialized to zero, until convergence. The second question asks if the point (5,2), labeled +1, could have been the first point considered by the algorithm, given the number of mistakes shown for each point.

Uploaded by

Prashanth R
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 27

edX MIT MIDTERM EXAM

Question 1(1) in TEXT:

Find me solution to the following two sub question after understanding the main question
and data given in table with explanation to prove it right:

Question:
What is the number of mistakes made by the linear perceptron algorithm on each point,
given that we initialize the parameters to all zero values and run the algorithm through these
points in a particular order until convergence?

Table of Data:

| Label | Coordinates | Perceptron Mistakes |


|-------|-------------|---------------------|
| -1 | (0,0) |1 |
| -1 | (2,0) |9 |
| -1 | (3,0) | 10 |
| -1 | (0,2) |5 |
| -1 | (2,2) |9 |
| +1 | (5,1) | 11 |
| +1 | (5,2) |0 |
| +1 | (2,4) |3 |
| +1 | (4,4) |1 |
| +1 | (5,5) |1 |

1. What is the resulting offset parameter theta_0?


Enter the numerical value for theta_0

Theta_0 :______________

2. What is the resulting parameter theta?


(Enter theta as a vector, e.g. type [0,1] if theta = [0 1]^T.)

Theta: ______________
Question 1.2. in TEXT:

Question:
We initialize the parameters to all zero values and run the linear perceptron algorithm
through these points in a particular order until convergence. The number of mistakes made
on each point are shown in the table below.

Table of data:

| Label | Coordinates | Perceptron Mistakes |


|-------|-------------|---------------------|
| -1 | (0,0) |1 |
| -1 | (2,0) |9 |
| -1 | (3,0) | 10 |
| -1 | (0,2) |5 |
| -1 | (2,2) |9 |
| +1 | (5,1) | 11 |
| +1 | (5,2) |0 |
| +1 | (2,4) |3 |
| +1 | (4,4) |1 |
| +1 | (5,5) |1 |

The mistakes that the algorithm makes often depend on the order in which the points were
considered. Could the point (5,2) labeled +1 have been the first one considered?
○ yes
○ no
○ depends
END

You might also like