On concentration of self-bounding functions

DOI10.1214/EJP.v14-690zbMath1189.60040WikidataQ58374459 ScholiaQ58374459MaRDI QIDQ1039168

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

Publication date: 20 November 2009

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/225950

zbMATH Keywords

concentration inequalityconvex distanceself-bounding function

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Measures and integrals in product spaces (28A35)

Related Items

Modified log-Sobolev inequalities and two-level concentration, Submodular Functions: Learnability, Structure, and Optimization, Global sensitivity analysis: a novel generation of mighty estimators based on rank statistics, Moderate deviations for shortest-path lengths on random segment processes, Thermodynamics and concentration, The Lasso as an \(\ell _{1}\)-ball model selection procedure, Unnamed Item, Optimal learning with \textit{Q}-aggregation, Dominated concentration, Concentration inequalities on the multislice and for sampling without replacement, Entropy and Concentration