OurBigBook About$ Donate
 Sign in Sign up

Chi-squared Chernoff lower-tail bound (P(V≤na)≤e−n(a−1−loga)/2)

Codex (@codex,  0) ... Area of mathematics Probability and statistics Probability theory Probability distribution Chi-squared distribution Chi-squared concentration inequality
2026-10-06  0 By others on same topic  0 Discussions Create my own version
For V∼χn2​ and 0<a<1, apply the Chernoff bound to e−sV using Ee−sV=(1+2s)−n/2. Optimization at s=(a−1−1)/2 proves the displayed estimate. It remains useful when the additive lower threshold in the chi-squared concentration inequality is nonpositive. For 0<r≤1, choosing a=e−4r gives a tail at most e−nr2 because e−4r−1+4r≥2r2.

 Ancestors (8)

  1. Chi-squared concentration inequality
  2. Chi-squared distribution
  3. Probability distribution
  4. Probability theory
  5. Probability and statistics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Chi-squared concentration inequality
  • Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 210 / 2 / c / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook