Pages that link to "Item:Q4487095"

The following pages link to A sharp concentration inequality with applications (Q4487095):

Displaying 36 items.

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