The VC-dimension and point configurations in Rd

Abstract

Given a set X and a collection H of functions from X to \0,1\, the VC-dimension measures the complexity of the hypothesis class H in the context of PAC learning. In recent years, this has been connected to geometric configuration problems in vector spaces over finite fields. In particular, it is easy to show that the VC-dimension of the set of spheres of a given radius in Fqd is equal to d+1, since this is how many points generically determine a sphere. It is known that for E⊂eq Fqd, |E|≥ qd-1d-1, the set of spheres centered at points in E, and intersected with the set E, has VC-dimension either d or d+1. In this paper, we study a similar question over Euclidean space. We find an explicit dimensional threshold sd<d so that whenever E⊂eq Rd, d≥ 3, and the Hausdorff dimension of E is at least sd, it follows that there exists an interval I such that for any t∈ I, the VC-dimension of the set of spheres of radius t centered at points in E, and intersected with E, is at least 3. In the process of proving this theorem, we also provide the first explicit dimensional threshold for a set E⊂eq R3 to contain a 4-cycle, i.e. x1,x2,x3,x4∈ E satisfying |x1-x2|=|x2-x3|=|x3-x4|=|x4-x1|

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…