On the VC-Dimension of Visibility in Monotone Polygons.
Matt GibsonErik KrohnQing WangPublished in: CCCG (2014)
Keyphrases
- vc dimension
- upper bound
- lower bound
- sample complexity
- concept classes
- statistical learning theory
- vapnik chervonenkis dimension
- sample size
- covering numbers
- concept class
- distribution free
- worst case
- inductive inference
- empirical risk minimization
- generalization bounds
- uniform convergence
- boolean functions
- compression scheme
- convex hull
- pac learnability
- pac learning
- generalization error
- euclidean space
- linear functions
- theoretical analysis
- small number
- reinforcement learning
- learning algorithm