2004
DOI: 10.1214/009117904000000360
|View full text |Cite
|
Sign up to set email alerts
|

On Hoeffding’s inequalities

Abstract: In a celebrated work by Hoeffding [J. Amer. Statist. Assoc. 58 (1963) [13][14][15][16][17][18][19][20][21][22][23][24][25][26][27][28][29][30], several inequalities for tail probabilities of sums Mn = X1 + · · · + Xn of bounded independent random variables Xj were proved. These inequalities had a considerable impact on the development of probability and statistics, and remained unimproved until 1995 when Talagrand [Inst. HautesÉtudes Sci. Publ. Math. 81 (1995a) 73-205] inserted certain missing factors in th… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
130
0

Year Published

2007
2007
2020
2020

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 119 publications
(134 citation statements)
references
References 28 publications
(39 reference statements)
2
130
0
Order By: Relevance
“…Generalizations of the Bernstein and Bennet-Hoeffding inequalities are obtained in [14], [15], [16], [17], and [18]. Probabilities of large deviations of Sn are studied in [19] under the condition max 1≤k≤n E|X k | t < ∞.…”
Section: Q(x) = P(xn > X) + P(bn > X)mentioning
confidence: 99%
“…Generalizations of the Bernstein and Bennet-Hoeffding inequalities are obtained in [14], [15], [16], [17], and [18]. Probabilities of large deviations of Sn are studied in [19] under the condition max 1≤k≤n E|X k | t < ∞.…”
Section: Q(x) = P(xn > X) + P(bn > X)mentioning
confidence: 99%
“…Moreover, some tight lower bounds are also given, which were not considered by Talagrand [45], Bentkus [5] and Pinelis [36]. In particular, we improve Talagrand's inequality to an equality, which will imply simple large deviation expansions.…”
Section: Introductionmentioning
confidence: 98%
“…Other improvements on Hoeffding's bound can be found in Bentkus [5] and Pinelis [36]. Bentkus's inequality [5] is much better than (1.9) in the sense that it recovers a factor of order 1 x for all x 0 instead of the range 0 x σ Kb , and do not assume that ξ i 's have moments of order larger than 2; see also Pinelis [37] for a similar improvement on Bennett-Hoeffding's bound.…”
Section: Introductionmentioning
confidence: 98%
See 2 more Smart Citations