VC density and dp rank
Abstract
We derive that dpR(n) ≤ dens(n) ≤ dpR(n)+1, where dens(n) is the supremum of the VC density of all formulas in n parameters, and dpR(n) is the maximum depth of an ICT pattern in n variables. Consequently, strong dependence is equivalent to finite VC density.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.