Se p 20 02 Entropy and the Combinatorial Dimension

نویسنده

  • R. Vershynin
چکیده

We solve Talagrand’s entropy problem: the L2-covering numbers of every uniformly bounded class of functions are exponential in its shattering dimension. This extends Dudley’s theorem on classes of {0, 1}valued functions, for which the shattering dimension is the VapnikChervonenkis dimension. In convex geometry, the solution means that the entropy of a convex body K is controlled by the maximal dimension of a cube of a fixed side contained in the coordinate projections of K. This has a number of consequences, including the optimal Elton’s Theorem and estimates on the uniform central limit theorem in the real valued case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric parameters in Learning Theory

3 Uniform measures of complexity 12 3.1 Metric entropy and the combinatorial dimension . . . . . . . . . 12 3.1.1 Binary valued classes . . . . . . . . . . . . . . . . . . . . . 13 3.1.2 Real valued classes . . . . . . . . . . . . . . . . . . . . . . 15 3.2 Random averages and the combinatorial dimension . . . . . . . . 17 3.3 Phase transitions in GC classes . . . . . . . . . . . . . . . . . . ...

متن کامل

Se p 20 02 The optimal order for the p - th moment of sums of independent random variables with respect to symmetric norms and related combinatorial estimates ‡

For n independent random variables f1, .., fn and a symmetric norm ‖ ‖X on Rn, we show that for 1 ≤ p < ∞ 1 2 + 4 √ 2     (n 1 n ∫ 0 h∗(s)pds) 1 p + ∥ ∥ ∥ ∥ ∥ ∥ ∥ ∥ n ∑

متن کامل

ar X iv : 0 80 9 . 45 02 v 1 [ he p - la t ] 2 5 Se p 20 08 Entanglement entropy in SU ( N ) gauge theory

The entanglement entropy of SU(N) lattice gauge theory is studied exactly in 1 + 1 space-time dimensions and in Migdal-Kadanoff approximation in higher dimensional space. The existence of a non-analytical behavior reminiscent of a phase transition for a characteristic size of the entangled region is demonstrated for higher dimensional theories.

متن کامل

Entropy and the Combinatorial Dimension

We solve Talagrand’s entropy problem: the L2-covering numbers of every uniformly bounded class of functions are subexponential in the combinatorial dimension of the class.

متن کامل

ua nt - p h / 98 06 02 7 v 1 8 J un 1 99 8 New approach to ε - entropy and Its comparison with Kolmogorov ’ s ε - entropy

Kolmogorov introduced a concept of ε-entropy to analyze information in classical continuous system. The fractal dimension of geometrical sets was introduced by Mandelbrot as a new criterion to analyze the complexity of these sets. The ε-entropy and the fractal dimension of a state in general quantum system were introduced by one of the present authors in order to characterize chaotic properties...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003