For a Gaussian random vector and an -Lipschitz function in the Euclidean norm, put . If , the Gaussian concentration inequality gives
and therefore
Write with a standard Gaussian random vector . The composed function has Lipschitz constant at most . The Gaussian logarithmic Sobolev inequality and Herbst argument give the exponential bound, and the Chernoff bound supplies the tails.[ref]
For example, has , so its deviations depend on the largest covariance eigenvalue rather than directly on the number of coordinates. The center can still grow with dimension. If , is constant almost surely and every positive deviation has probability zero.
For a standard Gaussian vector and a smooth Lipschitz function with , represent its centered value as the terminal martingale . The Itô formula gives gradient integrand , whose norm is at most . Its terminal quadratic variation is therefore at most . The Dambis-Dubins-Schwarz theorem bounds the terminal deviation by a maximum of Brownian motion over . Symmetry, the Brownian reflection principle, and the Gaussian tail bound give the displayed inequality. The square on the Lipschitz constant is essential by scaling.
For independent and identically distributed random variables with a centered multivariate normal distribution, a continuously differentiable function with bounded gradient, and a convex function for which the expressions are integrable, the displayed inequality holds. First apply Jensen inequality conditionally to . For the Gaussian rotation of independent copies, the chain rule gives . A second application of Jensen inequality to the uniform measure on , followed by the Gaussian rotation of independent copies, proves the inequality. The useful choice yields a Gaussian concentration inequality through an exponential moment of an absolute standard normal variable.

Articles by others on the same topic (0)

There are currently no matching articles.