A sharp concentration inequality with applications

From MaRDI portal
Publication:4487095

DOI<277::AID-RSA4>3.0.CO;2-1 10.1002/(SICI)1098-2418(200005)16:3<277::AID-RSA4>3.0.CO;2-1zbMath0954.60008OpenAlexW2163032969WikidataQ58374479 ScholiaQ58374479MaRDI QIDQ4487095

Stéphane Boucheron, Pascal Massart, Gábor Lugosi

Publication date: 17 August 2000

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(200005)16:3<277::aid-rsa4>3.0.co;2-1



Related Items

About the constants in Talagrand's concentration inequalities for empirical processes., The symmetry in the martingale inequality, Complexity regularization via localized random penalties, The infamous upper tail, Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder), Rigorous verification, validation, uncertainty quantification and certification through concentration-of-measure inequalities, Model selection by bootstrap penalization for classification, On Dvoretzky's theorem for subspaces of \(L_p\), Random sampling of sparse trigonometric polynomials, Modified log-Sobolev inequalities and two-level concentration, Local Rademacher complexity: sharper risk bounds with and without unlabeled samples, On combinatorial testing problems, About the rate function in Talagrand's inequality for empirical processes, Metamodel construction for sensitivity analysis, On the empirical estimation of integral probability metrics, On the Bennett-Hoeffding inequality, An improved analysis of the Rademacher data-dependent bound using its self bounding property, U-Processes and Preference Learning, Efficient blocking probability computation of complex traffic flows for network dimensioning, Concentration inequalities using the entropy method, Symmetrization approach to concentration inequalities for empirical processes., Local tail bounds for functions of independent random variables, Aspects of discrete mathematics and probability in the theory of machine learning, Some applications of concentration inequalities to statistics, Convergence properties of functional estimates for discrete distributions, Moment inequalities for functions of independent random variables, A local Vapnik-Chervonenkis complexity, Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions, Theory of Classification: a Survey of Some Recent Advances, Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas, Expected worst-case partial match in random quadtries, Modified log-Sobolev inequalities, Beckner inequalities and moment estimates, On the typical case complexity of graph optimization, Local Rademacher complexities, A Bennett concentration inequality and its application to suprema of empirical processes, Laws of large numbers and tail inequalities for random tries and PATRICIA trees



Cites Work