Tight lower bound on the probability of a binomial exceeding its expectation

DOI10.1016/j.spl.2013.12.009zbMath1293.60024arXiv1306.1433OpenAlexW2962814541MaRDI QIDQ2452784

Mehryar Mohri, Spencer Greenberg

Publication date: 5 June 2014

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.1433

zbMATH Keywords

lower boundexpected valuebinomial distributionmachine learningrelative deviation

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Probability distributions: general theory (60E05)

Related Items (16)

An elementary analysis of the probability that a binomial random variable exceeds its expectation ⋮ A lower bound on the probability that a binomial random variable is exceeding its mean ⋮ Simple dynamics for plurality consensus ⋮ On the probability that a binomial variable is at most its expectation ⋮ A tight runtime analysis for the \((\mu + \lambda)\) EA ⋮ A study on the Poisson, geometric and Pascal distributions motivated by Chvátal's conjecture ⋮ Convex transform order of Beta distributions with some consequences ⋮ Relative deviation learning bounds and generalization with unbounded loss functions ⋮ Multiplicative up-drift ⋮ Best lower bound on the probability of a binomial exceeding its expectation ⋮ Working principles of binary differential evolution ⋮ The deficiency introduced by resampling ⋮ On the lifetime of a size-dependent branching process ⋮ Robustness of randomized rumour spreading ⋮ On the Chvátal-Janson conjecture ⋮ A model of random industrial SAT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A result of Vapnik with applications
• Neyman-Pearson classification, convexity and stochastic constraints
• Estimation of Dependences Based on Empirical Data
• Univariate Discrete Distributions

This page was built for publication: Tight lower bound on the probability of a binomial exceeding its expectation