A sharp concentration inequality with applications
From MaRDI portal
Recommendations
Cites work
- A measure concentration inequality for contracting Markov chains
- A simple proof of the blowing-up lemma (Corresp.)
- About the constants in Talagrand's concentration inequalities for empirical processes.
- An inequality related to the isoperimetric inequality
- Bounding \(\bar d\)-distance by informational divergence: A method to prove measure concentration
- Bounds on conditional probabilities with applications in multi-user communication
- Concentration of measure and isoperimetric inequalities in product spaces
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- Majorizing measures: The generic chaining
- New concentration inequalities in product spaces
- Nonnegative entropy measures of multivariate symmetric correlations
- On Increasing Subsequences of I.I.D. Samples
- On prediction of individual sequences
- On Talagrand's deviation inequalities for product measures
- On the independence number of random graphs
- On the length of the longest monotone subsequence in a random permutation
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Some applications of concentration inequalities to statistics
- Structural risk minimization over data-dependent hierarchies
Cited in
(47)- On concentration of self-bounding functions
- Concentration inequalities using the entropy method
- Symmetrization approach to concentration inequalities for empirical processes.
- 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
- The symmetry in the martingale inequality
- On Dvoretzky's theorem for subspaces of \(L_p\)
- Local Rademacher complexity: sharper risk bounds with and without unlabeled samples
- Moment inequalities for functions of independent random variables
- Expected worst-case partial match in random quadtries
- About the constants in Talagrand's concentration inequalities for empirical processes.
- Complexity regularization via localized random penalties
- On the empirical estimation of integral probability metrics
- Generalizations of some concentration inequalities
- Modified log-Sobolev inequalities, Beckner inequalities and moment estimates
- A local Vapnik-Chervonenkis complexity
- Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Model selection by bootstrap penalization for classification
- On the Bennett-Hoeffding inequality
- Local tail bounds for functions of independent random variables
- Aspects of discrete mathematics and probability in the theory of machine learning
- On the typical case complexity of graph optimization
- Local Rademacher complexities
- Sharp bounds for cumulative distribution functions
- Rigorous verification, validation, uncertainty quantification and certification through concentration-of-measure inequalities
- Convergence properties of functional estimates for discrete distributions
- Optimal bounds on approximation of submodular and XOS functions by juntas
- Theory of Classification: a Survey of Some Recent Advances
- About the rate function in Talagrand's inequality for empirical processes
- The infamous upper tail
- An improved analysis of the Rademacher data-dependent bound using its self bounding property
- Metamodel construction for sensitivity analysis
- scientific article; zbMATH DE number 851663 (Why is no real title available?)
- Modified log-Sobolev inequalities and two-level concentration
- U-Processes and Preference Learning
- Some applications of concentration inequalities to statistics
- On combinatorial testing problems
- Prophet inequalities via the expected competitive ratio
- Improved approximation for two-dimensional vector multiple knapsack
- Patricia's bad distributions
- An EPTAS for cardinality constrained multiple knapsack via iterative randomized rounding
- Improved approximation for two-dimensional vector multiple knapsack
- q-partitioning valuations: exploring the space between subadditive and fractionally subadditive valuations
- On McDiarmid's concentration inequality
- Random sampling of sparse trigonometric polynomials
- Efficient blocking probability computation of complex traffic flows for network dimensioning
This page was built for publication: A sharp concentration inequality with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487095)
