On concentration inequalities for vector-valued Lipschitz functions

From MaRDI portal




Abstract: We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct application of a classical theorem due to Bobkov and G"{o}tze.









This page was built for publication: On concentration inequalities for vector-valued Lipschitz functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2244515)