
CSC2515 Fall 2020 Midterm Test
(e) [2 points] Most machine learning algorithms, in general, can learn a model with
a Bayes optimal error rate.
(f) [2 points] The k-means algorithm is guaranteed to converge to the global mini-
mum
(g) [2 points] When optimizing a regression problem where we know that only some
of our features are useful, we should use L1regularization.
(h) [2 points] For a given binary classification problem, a linear SVM model and a
logistic regression model will converge to the same decision boundary.
2
!"#$% &
?";%$ */(5-"# %..*. ."(% 5$ =()% 4%$( 7% =%8%. )*/% (* 2* =75() "3; #%".353, "#,*.5()- 6
7)50) ;5%#2$ F%.* 45"$ ="32 8".5"30% &G".2#; "3; "#,*.5()- =0*8%.%2 53 ()5$ 0*+.$% "0)5%8%$ =()5$
&
!"#$% &
>)% =*4H%0(58% I#
J- K$ (. LM*1 @<-%"3$ 5$ =3*( 0*38%9 6
$* =0**.253"(% 2%$0%3( =*3 I5$
3*( ,+"."3(%%2 (* 0*38%.,% (* ()% ,#*4"# -535-+- &'#$* =()%.% 5$ =3*()53, (* /.%8%3(
B<-%"3$ =$(+0@ 53 #*0"# -535-" 53 ()% "#,*.5()- &
>.+% &
J1 ;*+ 4%#5%8% *3#; "$-"## 1."0(5*3 *1 =-"3; 1%"(+.%$ =5$ #5@%#; (* 4% .%#%8"3( 6
;*+ =+$% N6.%,+#".5F"(5*3 ()"( %30*+.",%$ =$-"## 7%5,)($ =(* 4% =%9"0(#; F%.* ="32 ,58%$ ;*+
$/".$% */(5-"# 7%5,)( 8%0(*.
!"#$% &>)%; ".% $5-5#". 4+( 3*( ()% $"-% &>)% "$-/(*50 4%)"85*. *1
N*,5$(50 <O.*$$ &A3(.*/; #*$$ =5$ =$5-5#". (* ()% G53,% #*$$ 53 EPQ 6
$* =()%; ".% $+,,%$(53, 8%.; $5-5#". 7%5,)($ 1.*- ,."25%3( 2%$0%3(
6
()+$ $5-5#". =2%05$5*3 4*+32".5%$ 64+( =3*( =()% $"-% &
R
!53% M
EPQ S73&/5&3,&A&05 <
=K;#T0+.4 6JUF(.#7##
K
#*$$
V
WN53%". O#"$$515%. 75() G53,% #*$$ "32 N" .%,+#".5F"(5*3 <
<= $ *R
N*,5$(50 X%,.%$$5*3
-53 !J
6
N50% OY &=(M("## ZJ>
F