in the recitation we said that one way to choose k is to use half of the campus as train and half as test.

in this graph, <rec1_2014 - figure1.4>, the test graph rises at some point, even though k gets bigger.

can someone give an example or intuition about why this could happen? from what i understand, when k is bigger, the score of the algorithm should improve.