mlsanityData to 7 Oct 2026

Some Hoeffding- and Bernstein-type Concentration Inequalities

arXiv 2102.06304 ↗First posted 11 Feb 2021math.PR cs.LG stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

We prove concentration inequalities for functions of independent random variables {under} sub-gaussian and sub-exponential conditions. The utility of the inequalities is demonstrated by an extension of the now classical method of Rademacher complexities to Lipschitz function classes and unbounded sub-exponential distribution.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 3 of its 14 references that are in the map. First posted on arXiv 11 Feb 2021.

Builds on

3 of 14 references.

References · 3

  1. 2014Learning without Concentrationcited by 50
  2. 2013Concentration in unbounded metric spaces and algorithmic stabilitycited by 21
  3. 2013Relative Deviation Learning Bounds and Generalization with Unbounded Loss Functionscited by 15

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.