#1




On Q9
Trying to solve this question (sadly I failed) I realized that I didn't quite understand the shattering correctly in the beginning. In the meantime I've clarified this but still I don't know how to answer this question.
I imagine that must be a particular way of either selecting the right sets of points from the options of the question to prove they can be shattered or to identify the break point for this case to ensure that any set of points equal or greater can't be shattered. Any suggestions on how to approach the solution? Thank you 
#2




Re: On Q9
Quote:
The choice of where to place the points should be done so as to maximize the chances that they will be shattered. Since the triangle is a convex region, having one of the points being 'internal' to other points will preclude the possibility of shattering (same situation as in the case of convex regions discussed in the lecture). Therefore, choosing the points at the perimeter of a circle (for example) would be a good starting point. Now, imagine all kinds of triangles trying to split these points into different dichotomies, and look for how many points you can afford to have while being able to split them in every possible way using triangles. It's an interesting puzzle to work on.
__________________
Where everyone thinks alike, no one thinks very much 
#3




Re: On Q9
Can it be several overlapping triangles (like in picture) or just one triangle?
Last edited by melipone; 01262013 at 10:06 AM. Reason: Check on picture 
#4




Re: On Q9
Since this thread doesn't say *Answer* in the title, I don't think we can discuss any hints further than the notion of clever point placement.
I believe it should only be one triangle. 
#5




Re: On Q9
One word in addition  with triangles we can't afford the convenience of having arbitrarily many vertices (as with convex sets in general  just stating the obvious). It might therefore be useful to keep in mind that the triangle's vertices don't have to rest on the circle, though the data points better do. As the question states, for a point to be covered (h(x)=+1) it suffices if it lies within the triangle, not necessarily directly on its edges or vertices.

#6




Re: On Q9
It's interesting to consider the relationship between the parametrisation of hypotheses and VC dimension. A triangle requires a fixed finite number of parameters (count them ), more general convex sets can require an unbounded number of parameters. I wouldn't expect a hypothesis set with a finite parametrisation to have an infinite VC dimension (although the two dimensions are only loosely related) but I haven't investigated the details much.

Thread Tools  
Display Modes  

