Reminds me of VC dimension kind of stuff for describing binary classifiers. That first example w/ 5 points necessitating a convex 4 sided polygon is like the V

Reminds me of VC dimension kind of stuff for describing binary classifiers. That first example w/ 5 points necessitating a convex 4 sided polygon is like the VC dimension proof that an axis aligned rectangle can never correctly classify 5 points, since you can never arrange 5 points w/o one of them being in the body of a rectangular region surrounding the other 4 (and that interior point's label therefore can't be arbitrary and still correctly classified). more: https://www.cs.princeton.edu/courses/archive/spring13/cos511/scribe_notes/0221.pdf https://www.cs.princeton.edu/courses/archive/spring13/cos511... Wonder if the 2^(n-2) + 1 rule is somewhere in the VC dim lit