The DOI matches its OpenAlex record.
Probability Inequalities for Sums of Bounded Random Variables
Abstract
Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S is bounded or bounded above. The bounds for Pr {S – ES ≥ nt} depend only on the endpoints of the ranges of the summands and the mean, or the mean and the variance of S. These results are then used to obtain analogous inequalities for certain sums of dependent random variables such as U statistics and the sum of a random sample without replacement from a finite population.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Mining high-speed data streams
Domingos, P., & Hulten, G. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347107 · Cited by 2,185
Concentration Inequalities: A Nonasymptotic Theory of Independence
Boucheron, S., Lugosi, G., & Massart, P. (2013) · doi:10.1093/acprof:oso/9780199535255.001.0001 · Cited by 1,768
Integrating structured biological data by Kernel Maximum Mean Discrepancy
Borgwardt, K. M., Gretton, A., Rasch, M. J., Kriegel, H.-P., Schölkopf, B., & Smola, A. J. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl242 · Cited by 1,674
Correcting Sample Selection Bias by Unlabeled Data
Huang, J., Smola, A. J., Gretton, A., Borgwardt, K. M., & Schölkopf, B. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0080 · Cited by 1,571
Measuring Statistical Dependence with Hilbert-Schmidt Norms
Gretton, A., Bousquet, O., Smola, A., & Schölkopf, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564089_7 · Cited by 1,560
Efficient Lattice (H)IBE in the Standard Model
Agrawal, S., Boneh, D., & Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_28 · Cited by 976
Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. (2011) · SIAM Journal on Computing · doi:10.1137/090756090 · Cited by 898
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Micciancio, D., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447360 · Cited by 907
High-dimensional Ising model selection using ℓ1-regularized logistic regression
Ravikumar, P., Wainwright, M. J., & Lafferty, J. D. (2010) · The Annals of Statistics · doi:10.1214/09-aos691 · Cited by 892
Semiparametric analysis of discrete response
Manski, C. F. (1985) · Journal of Econometrics · doi:10.1016/0304-4076(85)90009-0 · Cited by 563
Bottou, L., & Vapnik, V. (1992) · Neural Computation · doi:10.1162/neco.1992.4.6.888 · Cited by 542
Compressive Sensing by Random Convolution
Romberg, J. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/08072975x · Cited by 458
Theory of Classification: a Survey of Some Recent Advances
Boucheron, S., Bousquet, O., & Lugosi, G. (2005) · ESAIM: Probability and Statistics · doi:10.1051/ps:2005018 · Cited by 436
On the Composition of Zero-Knowledge Proof Systems
Goldreich, O., & Krawczyk, H. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539791220688 · Cited by 423
Finite-key analysis for measurement-device-independent quantum key distribution
Curty, M., Xu, F., Cui, W., Lim, C. C. W., Tamaki, K., & Lo, H.-K. (2014) · Nature Communications · doi:10.1038/ncomms4732 · Cited by 409
Covariate Shift by Kernel Mean Matching
Gretton, A., Smola, A., Huang, J., Schmittfull, M., Borgwardt, K., & Schölkopf, B. (2008) · Dataset Shift in Machine Learning · doi:10.7551/mitpress/9780262170055.003.0008 · Cited by 378
Centrality Measures Based on Current Flow
Brandes, U., & Fleischer, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-31856-9_44 · Cited by 333
Faster Fully Homomorphic Encryption
Stehlé, D., & Steinfeld, R. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_22 · Cited by 330
Chernoff–Hoeffding Bounds for Applications with Limited Independence
Schmidt, J. P., Siegel, A., & Srinivasan, A. (1995) · SIAM Journal on Discrete Mathematics · doi:10.1137/s089548019223872x · Cited by 314
Computing with Noisy Information
Feige, U., Raghavan, P., Peleg, D., & Upfal, E. (1994) · SIAM Journal on Computing · doi:10.1137/s0097539791195877 · Cited by 304
Learning model trees from evolving data streams
Ikonomovska, E., Gama, J., & Džeroski, S. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0201-y · Cited by 304
Will Humans-in-the-Loop Become Borgs? Merits and Pitfalls of Working with AI
Fügener, A., Grahl, J., Gupta, A., & Ketter, W. (2021) · MIS Quarterly · doi:10.25300/misq/2021/16553 · Cited by 469
Boyer, M., Gelles, R., Kenigsberg, D., & Mor, T. (2009) · Physical Review A · doi:10.1103/physreva.79.032341 · Cited by 297
Model Selection and Error Estimation
Bartlett, P. L., Boucheron, S., & Lugosi, G. (2002) · Machine Learning · doi:10.1023/a:1013999503812 · Cited by 297
Approximate Probabilistic Model Checking
Hérault, T., Lassaigne, R., Magniette, F., & Peyronnet, S. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24622-0_8 · Cited by 295
New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
Krahmer, F., & Ward, R. (2011) · SIAM Journal on Mathematical Analysis · doi:10.1137/100810447 · Cited by 290
About the constants in Talagrand's concentration inequalities for empirical processes
Massart, P. (2000) · The Annals of Probability · doi:10.1214/aop/1019160263 · Cited by 280
Simulating Large Quantum Circuits on a Small Quantum Computer
Peng, T., Harrow, A. W., Ozols, M., & Wu, X. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.150504 · Cited by 267
Universal variational quantum computation
Biamonte, J. (2021) · Physical Review A · doi:10.1103/physreva.103.l030401 · Cited by 102
Efficient verification of boson sampling
Chabaud, U., Grosshans, F., Kashefi, E., & Markham, D. (2021) · Quantum · doi:10.22331/q-2021-11-15-578 · Cited by 37
Bandwidth-Optimal Random Shuffling for GPUs
Mitchell, R., Stokes, D., Frank, E., & Holmes, G. (2022) · ACM Transactions on Parallel Computing · doi:10.1145/3505287 · Cited by 6
Metadata
- Authors
- Hoeffding, W.
- Venue
- Journal of the American Statistical Association
- Published
- 1963-03-01
- Volume
- 58
- Issue
- 301
- Pages
- 13-13
- ISSN
- 0162-1459 (ISSN-L)
- OpenAlex
- W4238472918
- Cited by
- 1,166
- References
- 0
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.