Stéphane Boucheron

Prof. Stéphane Boucheron

orcid

Research Focus & Metrics

Academic Career Length

30Years (1997-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 February 2013
Verified
Book
Closed access
SBStéphane Boucheron
Stéphane Boucheron
GLGábor Lugosi
Gábor Lugosi
PMPascal Massart
Pascal Massart
This monograph presents a mathematical theory of concentration inequalities for functions of independent random variables. The basic phenomenon under investigation is that if a function of many independent random variables does not depend too much on any of them then it is concentrated around its expected value. This book offers a host of inequalities to quantify this statement. The authors describe the interplay between the probabilistic structure (independence) and a variety of tools ranging from functional inequalities, transportation arguments, to information theory. Applications to the study of empirical processes, random projections, random matrix theory, and threshold phenomena are presented. The book offers a self-contained introduction to concentration inequalities, including a survey of concentration of sums of independent random variables, variance bounds, the entropy method, and the transportation method. Deep connections with isoperimetric problems are revealed. Special attention is paid to applications to the supremum of empirical processes.

15 November 2005 in ESAIM: Probability and Statistics
Verified
Journal Article
Open access
PDF file
SBStéphane Boucheron
Stéphane Boucheron
OBOlivier Bousquet
Olivier Bousquet
GLGábor Lugosi
Gábor Lugosi
The last few years have witnessed important new developments in the theory and practice of pattern classification. We intend to survey some of the main new ideas that have led to these recent results.

1 July 2003 in The Annals of Probability
Verified
Journal Article
Open access
PDF file
SBStéphane Boucheron
Stéphane Boucheron
GLGábor Lugosi
Gábor Lugosi
PMPascal Massart
Pascal Massart
We investigate a new methodology, worked out by Ledoux and Massart, to prove concentration-of-measure inequalities. The method is based on certain modified logarithmic Sobolev inequalities. We provide some very simple and general ready-to-use inequalities. One of these inequalities may be considered as an exponential version of the Efron--Stein inequality. The main purpose of this paper is to point out the simplicity and the generality of the approach. We show how the new method can recover many of Talagrand's revolutionary inequalities and provide new applications in a variety of problems including Rademacher averages, Rademacher chaos, the number of certain small subgraphs in a random graph, and the minimum of the empirical risk in some statistical estimation problems.

1 January 2004
Verified
Book Chapter
Closed access
PDF file
OBOlivier Bousquet
Olivier Bousquet
SBStéphane Boucheron
Stéphane Boucheron
GLGábor Lugosi
Gábor Lugosi

1 March 2005 in The Annals of Probability
Verified
Journal Article
Open access
PDF file
SBStéphane Boucheron
Stéphane Boucheron
OBOlivier Bousquet
Olivier Bousquet
GLGábor Lugosi
Gábor Lugosi
PMPascal Massart
Pascal Massart
A general method for obtaining moment inequalities for functions of independent random variables is presented. It is a generalization of the entropy method which has been used to derive concentration inequalities for such functions [Boucheron, Lugosi and Massart Ann. Probab. 31 (2003) 1583–1614], and is based on a generalized tensorization inequality due to Latała and Oleszkiewicz [Lecture Notes in Math. 1745 (2000) 147–168]. The new inequalities prove to be a versatile tool in a wide range of applications. We illustrate the power of the method by showing how it can be used to effortlessly re-derive classical inequalities including Rosenthal and Kahane–Khinchine-type inequalities for sums of independent random variables, moment inequalities for suprema of empirical processes and moment inequalities for Rademacher chaos and U-statistics. Some of these corollaries are apparently new. In particular, we generalize Talagrand’s exponential inequality for Rademacher chaos of order 2 to any order. We also discuss applications for other complex functions of independent random variables, such as suprema of Boolean polynomials which include, as special cases, subgraph counting problems in random graphs.

1 July 2002 in Machine Learning
Verified
Journal Article
Closed access
PDF file
PBPeter L. Bartlett
Peter L. Bartlett
SBStéphane Boucheron
Stéphane Boucheron
GLGábor Lugosi
Gábor Lugosi