Concentration Inequalities

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.

• Type: Conference
• Year: 2003
• Where: AC
• Authors: Stéphane Boucheron, Gábor Lugosi, Olivier Bousquet
• Keywords: AC 2003, Concentration Inequalities, Independent Random Variables, Powerful Inequalities, Software Engineering