Vapnik-Chervonenkis density in some theories without the independence property, II

Vapnik-Chervonenkis density in some theories without the independence property, I

We recast the problem of calculating Vapnik-Chervonenkis (VC) density into one of counting types, and thereby calculate bounds (often optimal) on the VC density for some weakly o-minimal, weakly quasi-o-minimal, and $P$-minimal theories.

Continuous and Random Vapnik-Chervonenkis Classes

We show that if $T$ is a dependent theory then so is its Keisler randomisation $T^R$. In order to do this we generalise the notion of a Vapnik-Chervonenkis class to families of $[0,1]$-valued functions (a \emph{continuous} Vapnik-Chervonenkis class), and we characterise families of functions having this property via the growth rate of the mean width of an associated family of convex compacts.

Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property

This paper presents some finite combinatorics of set systems with applications to model theory, particularly the study of dependent theories. There are two main results. First, we give a way of producing lower bounds on VC_ind-density, and use it to compute the exact VC_ind- density of polynomial inequalities, and a variety of geometric set families. The main technical tool used is the notion of a maximum set system, which we juxtapose to indiscernibles. In the second part of the paper we give a maximum set system analogue to Shelah's characterization of stability using indiscernible sequences…

Vapnik-Chervonenkis Dimension and Density on Johnson and Hamming Graphs

VC-dimension and VC-density are measures of combinatorial complexity of set systems. VC-dimension was first introduced in the context of statistical learning theory, and is tightly related to the sample complexity in PAC learning. VC-density is a refinement of VC-dimension. Both notions are also studied in model theory, in the context of \emph{dependent} theories. A set system that is definable by a formula of first-order logic with parameters has finite VC-dimension if and only if the formula is a dependent formula. In this paper we study the VC-dimension and the VC-density of the edge relati…

某些非交换群中广义等差数列的VC维

VC-dimension of generalized progressions in some nonabelian groups

本文使用统计学习理论中的VC维作为复杂度度量，分析了非交换群中广义等差数列的性质，并证明了有限生成自由群和整数Heisenberg群中相关集系统VC维的有限上界。

VC density of definable families over valued fields

We prove a tight bound on the number of realized $0/1$ patterns (or equivalently on the Vapnik-Chervonenkis codensity) of definable families in models of the theory of algebraically closed valued fields with a non-archimedean valuation. Our result improves the best known result in this direction proved by Aschenbrenner, Dolich, Haskell, Macpherson and Starchenko, who proved a weaker bound in the restricted case where the characteristics of the field $K$ and its residue field are both assumed to be $0$. The bound obtained here is optimal and without any restriction on the characteristics. We ob…