A uniform Dvoretzky-Kiefer-Wolfowitz inequality

Abstract

We show that under minimal assumptions on a class of functions H defined on a probability space (X,μ), there is a threshold 0 satisfying the following: for every ≥0, with probability at least 1-2(-c m) with respect to μ m, \[ h∈H t∈R | P(h(X)≤ t) - 1mΣi=1m 1(-∞,t](h(Xi)) | ≤ ;\] here X is distributed according to μ and (Xi)i=1m are independent copies of X. The value of 0 is determined by an unexpected complexity parameter of the class H that captures the set's geometry (Talagrand's γ1-functional). The bound, the probability estimate and the value of 0 are all optimal up to a logarithmic factor.

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…