The Vapnik-Chervonenkis dimension of cubes in R^d

12/20/2014
by   Christian J. J. Despres, et al.
0

The Vapnik-Chervonenkis (VC) dimension of a collection of subsets of a set is an important combinatorial concept in settings such as discrete geometry and machine learning. In this paper we prove that the VC dimension of the family of d-dimensional cubes in R^d is (3d+1)/2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2023

Concepts of Dimension for Convex Geometries

Let X be a finite set. A family P of subsets of X is called a convex geo...
research
07/20/2018

Optimal Bounds on the VC-dimension

The VC-dimension of a set system is a way to capture its complexity and ...
research
12/14/2019

The dimension of projections induced by a curve

The behavior of the Hausdorff dimension of a set when projected onto a s...
research
04/14/2021

On the Vapnik-Chervonenkis dimension of products of intervals in ℝ^d

We study combinatorial complexity of certain classes of products of inte...
research
09/16/2019

Learnability Can Be Independent of ZFC Axioms: Explanations and Implications

In Ben-David et al.'s "Learnability Can Be Undecidable," they prove an i...
research
06/14/2018

A Sauer-Shelah-Perles Lemma for Sumsets

We show that any family of subsets A⊆ 2^[n] satisfies A≤ O(n^d/2), wher...
research
08/13/2015

Borobudur was Built Algorithmically

The self-similarity of Indonesian Borobudur Temple is observed through t...

Please sign up or login with your details

Forgot password? Click here to reset