A sharp concentration inequality with applications

Random Structures and Algorithms

Volumn 16, Issue 3, 2000, Pages 277-292

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

^a Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

^b UNIVERSITAT POMPEU FABRA   (Spain)

^c UNIVERSITÉ PARIS SUD   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034344120     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(200005)16:3<277::AID-RSA4>3.0.CO;2-1     Document Type: Article

References (29)

1. R. Ahlswede, P. Gács, and J. Körner, Bounds on conditional probabilities with applications in multi-user communication, Z Wahrscheinlichkeitstheor Verwand Geb 34 (1976), 157-177. (Correction in 39 (1977), 353-354).
2. B. Bollobás, Random graphs, Academic Press, Orlando, 1985.
3. T.M. Cover and J.A. Thomas, Elements of information theory, John Wiley, New York, 1991.
4. A. Dembo, Information inequalities and concentration of measure, Ann Probab 25 (1997), 929-938.
5. J.-D. Deuschel and O. Zeitouni, On increasing subsequences of i.i.d. samples, Combin Probab Comput 8 (1999), 247-263.
6. L. Devroye, L. Györfi, and G. Lugosi, A probabilistic theory of pattern recognition, Springer-Verlag, New York, 1996.
7. A.M. Frieze, On the independence number of random graphs, Discrete Math 81 (1990), 171-175.
8. A.M. Frieze, On the length of the longest monotone subsequence in a random permutation, Ann Appl Probab 1 (1991), 301-305.
9. T.S. Han, Non negative entropy measures of multivariate symmetric correlations, Inform and Control 36 (1978), 133-156.
10. D. Haussler, N. Littlestone, and M. Warmuth, Predicting {0, 1}-functions on randomly drawn points. Inform and Comput 115 (1994), 248-292.
11. D.S. Johnson, A catalog of complexity classes, in Handbook of Theoretical Computer Science, A, MIT Press, Boston, 1990, pp. 67-162.
12. M. Ledoux, "Isoperimetry and gaussian analysis," Lectures on probability theory and statistics, Ecole d'Eté de Probabilités de St-Flour XXIV-1994, P. Bernard (Editor), LNM 1648, Springer-Verlag, Berlin, 1996, pp. 165-294.
13. M. Ledoux, On Talagrand's deviation inequalities for product measures, ESAIM: Probab Statist 1 (1996), 63-87, http://www.emath.fr/ps/.
14. L.H. Loomis and H. Whitney, An inequality related to the isoperimetric inequality, Bull Amer Math Soc 55 (1949), 961-962.
15. G. Lugosi and A. Nobel, Adaptive model selection using empirical complexities, Ann. Stat 27 (1999).
16. K. Marton, A simple proof of the blowing-up lemma, IEEE Trans Inform Theory 32 (1986), 445-446.
17. K. Marton, Bounding d̄-distance by informational divergence: a way to prove measure concentration, Ann Probab 24 (1996), 857-866.
18. K. Marton, A measure concentration inequality for contracting Markov chains, Geo Funct Anal 6 (1996), 556-571, (Erratum 7 (1997), 609-613).
19. P. Massart, About the constants in Talagrand's concentration inequalities for empirical processes. Ann Probab, to appear (2000).
20. P. Massart, Optimal constants for Hoeffding type inequalities, Technical report, Mathématiques, Université de Paris-Sud, Report 98.86, 1998.
21. P. Massart, Some applications of concentration inequalities to statistics, Technical report, Mathématiques, Université Paris-Sud, Report, 2000.
22. C. McDiarmid, "On the method of bounded differences," Surveys in combinatorics 1989, Cambridge University Press, Cambridge, 1989, pp. 148-188.
23. C. McDiarmid, "Concentration," Probabilistic methods for algorithmic discrete mathematics, M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed (Editors) Springer, New York, 1997, pp. 195-248.
24. J. Shawe-Taylor, P.L. Bartlett, R.C. Williamson, and M. Anthony, Structural risk minimization over data-dependent hierarchies, IEEE Trans Inform Theory 44 (1998), 1926-1940.
25. M. Talagrand, Concentration of measure and isoperimetric inequalities in product spaces, Publ Math del'IHES, 81 (1995), 73-205.
26. M. Talagrand, New concentration inequalities in product spaces Invent Math 126 (1996), 505-563.
27. M. Talagrand, A new look at independence, Ann Probab 24 (1996), 1-34.
28. V.N. Vapnik, The nature of statistical learning theory, Springer-Verlag, New York, 1995.
29. D. Zuckerman, Every NP-complete problem has a hard version, eighth IEEE Structure in Complexity Theory Conf, 1993, pp 305-312.