Concentration Inequalities
Stéphane Boucheron, Gábor Lugosi, Pascal Massart · Oxford University Press eBooks · 2013
Concentration inequalities deal with deviations of functions of independent random variables from their expectation. In the last decade new tools have been introduced making it possible to establish simple and powerful inequalities. These inequalities are at the heart of the mathematical analysis of various problems in machine learning and made it possible to derive new efficient algorithms. This text attempts to summarize some of the basic tools.
Cited by 1,722 works. doi:10.1093/acprof:oso/9780199535255.001.0001
Authors
References
- The Nature of Statistical Learning Theory
- Statistical Learning Theory
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Learnability and the Vapnik-Chervonenkis dimension
- A Probabilistic Theory of Pattern Recognition
- Elements of Information Theory
- On the method of bounded differences
- Probability Inequalities for Sums of Bounded Random Variables
- The Concentration of Measure Phenomenon