source¶
Carnegie Mellon University, c. l. n. (. source.
Cited by¶
1 citation across 1 artifact.
Domain-specific¶
- Bernstein inequalities (probability theory)
- In probability theory, Bernstein inequalities are concentration bounds controlling how far a sum of random variables can deviate from its mean.
SupportedVerified against the work's full text
The lecture notes present Bernstein's inequality as a tail bound for sums of independent random variables, within their treatment of concentration inequalities.
“But before we move on, let us give the bound that Sergei Bernstein gave in the 1920s: it uses knowledge about the variance of the ran- dom variable to get a potentially sharper bound than Theorem 10.8. Theorem 10.11 (Bernstein’s inequality).”
- In probability theory, Bernstein inequalities are concentration bounds controlling how far a sum of random variables can deviate from its mean.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:a30aacf13214 · see in the full table