CS 478 Machine Learning: Homework 3
Suggested Solutions
1
SVM inside-out, the Primal (15 points)
(a) It is easy to check that for the soft margin SVM, w = 0, = 1 is always a feasible solution. All the constraints are satised. (b) Consider the it
CS 478 Machine Learning: Homework 2
Suggested Solutions
1
Separable or Not?
(a) See the following tree:
(b) If we draw a large enough sample, there would be at least two points on each of the four positions. Since there is no noise in the label,
CS 478 Machine Learning: Homework 1
Suggested Solutions
1
kNN Decision Boundaries
(a)
(b) (c) It would be classied as circle. Adding one point is enough, say a cross at exactly (1,-1). (d) It would be classied as circle. The ve closest points ar
Problem 1: Viterbi Algorithm
[50 points]
(a) [5 points] By denition, y,t1 is the probability of the most probable English sequence corresponding to the rst t 1 Greek observations (x1 , x2 , ., xt1 ) that end
with the English character y. So, the most prob