Concentration inequalities using the entropy method

Annals of Probability

Volumn 31, Issue 3, 2003, Pages 1583-1614

  Boucheron, Stéphane ^a   Lugosi, Gábor ^b   Massart, Pascal ^c  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b UNIVERSITAT POMPEU FABRA   (Spain)

^c UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Concentration inequalities; Empirical processes; Random graphs

Indexed keywords

EID: 0038373013     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/aop/1055425791     Document Type: Article

References (37)

1. AHLSWEDE, R., GÁCS, P. and KÖRNER, J. (1976). Bounds on conditional probabilities with applications in multi-user communication. Z Wahrsch. Verw. Gebiete 34 157-177. [Correction (1977) 39 353-354.]
2. BARTLETT, P., BOUCHERON, S. and LUGOSI, G. (2002). Model selection and error estimation. Machine Learning 48 85-113.
3. BOBKOV, S. G. and LEDOUX, M. (1998). On modified logarithmic Sobolev inequalities for Bernouilli and Poisson measures. J. Funct. Anal. 156 347-365.
4. BOUCHERON, S., LUGOSI, G. and MASSART, P. (2000). A sharp concentration inequality with applications in random combinatorics and learning. Random Structures Algorithms 16 277-292.
5. BOUSQUET, O. (2002). A Bennett concentration inequality and its application to suprema of empirical processes. C. R. Acad. Sci. Paris Ser. I 334 495-500.
6. DE LA PEÑA, V. H. and GINÉ, E. (1999). Decoupling: From Dependence to Independence. Springer, New York.
7. DEMBO, A. (1997). Information inequalities and concentration of measure. Ann. Probab. 25 927-939.
8. EFRON, B. and STEIN, C. (1981). The jackknife estimate of variance. Ann. Statist. 9 586-596.
9. HALL, G. H., LITTLEWOOD, J. E. and PÓLYA, G. (1952). Inequalities. Cambridge Univ. Press.
10. JANSON, S. (2000). Poisson approximation for large deviations. Random Structures Algorithms 1 221-230.
11. JANSON, S., ŁUCZAK, T. and RUCIŃSKI, A. (2000). Random Graphs. Wiley, New York.
12. JANSON, S. and RUCIŃSKI, A. (2000). The deletion method for upper tail estimates. Technical Report 20, Uppsala Univ.
13. JANSON, S. and RUCIŃSKI, A. (2002). The infamous upper tail. Random Structures Algorithms 20 317-342.
14. KIM, J. H. and VU, V. (2000). Concentration of multivariate polynomials and applications. Combinatorica 20 417-434.
15. KOLTCHINSKII, V. and PANCHENKO, D. (2002). Empirical margin distributions and bounding the generalization error of combined classifiers. Ann. Statist. 30 1-50.
16. LEDOUX, M. (1996). Isoperimetry and Gaussian Analysis. Lecture Notes in Math. 1648 165-294. Springer, New York.
17. LEDOUX, M. (1996). On Talagrand's deviation inequalities for product measures. ESAIM: Probab. Statist. 1 63-87.
18. LEDOUX, M. (2001). The Concentration of Measure Phenomenon. Amer. Math. Soc., Alexandria, VA.
19. LEDOUX, M. and TALAGRAND, M. (1991). Probability in Banach Spaces. Springer, New York.
20. MARTON, K. (1986). A simple proof of the blowing-up lemma. IEEE Trans. Inform. Theory 32 445-446.
21. MARION, K. (1996). Bounding d̄-distance by informational divergence: A way to prove measure concentration. Ann. Probab. 24 857-866.
22. MARION, K. (1996). A measure concentration inequality for contracting Markov chains. Geom. Funct. Anal. 6 556-571. [Correction (1997) 7 609-613.]
23. MASSART, P. (1998). Optimal constants for Hoeffding type inequalities. Technical Report 98.86, Univ. Paris-Sud.
24. MASSART, P. (2000). About the constants in Talagrand's concentration inequalities for empirical processes. Ann. Probab. 28 863-884.
25. MASSART, P. (2000). Some applications of concentration inequalities to statistics. Ann. Fac. Sci. Toulouse Math. 9 245-303.
26. MCDIARMID, C. (1989). On the method of bounded differences. In Surveys in Combinatorics (J. Siemons, ed.) 148-188. Cambridge Univ. Press.
27. MCDIARMID, C. (1998). Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics (M. Habib, C. McDiarmid, J. Ramirez-Alfonsin and B. Reed, eds.)195-248. Springer, New York.
28. RIO, E. (2001). Inégalités de concentration pour les processus empiriques de classes de parties. Probab. Theory Related Fields 119 163-175.
29. SION, M. (1958). On general minimax theorems. Pacific J. Math. 8 171-176.
30. STEELE, J. M. (1986). An Efron-Stein inequality for nonsymmetric statistics. Ann. Statist. 14 753-758.
31. STEELE, J. M. (1996). Probability Theory and Combinatorial Optimization. SIAM, Philadelphia.
32. TALAGRAND, M. (1995). Concentration of measure and isoperimetric inequalities in product spaces. Publ. Math. I.H.E.S. 81 73-205.
33. TALAGRAND, M. (1996). New concentration inequalities in product spaces. Invent. Math. 126 505-563.
34. TALAGRAND, M. (1996). A new look at independence. Ann. Probab. 24 1-34.
35. VAN DER WAART, A. W. and WELLNER, J. A. (1996). Weak Convergence and Empirical Processes. Springer, New York.
36. VU, V. (2000). On the concentration of multivariate polynomials with small expectation. Random Structures Algorithms 16 344-363.
37. VU, V. (2001). A large deviation result on the number of small subgraphs of a random graph. Combin. Probab. Comput. 1 79-94.