The chi-squared moment generating function and its Chernoff bound
ProofIntermediate⏱ 30 minHigh-Dim Probabilitychi-squaredmgfchernoffjl
Problem
Let with i.i.d. standard normal.
- Show for .
- Derive the upper tail bound .
- Show the exponent is at most for .
Write a complete argument. Every inequality you use should be one you could state precisely.
Hints
Hints — 0 of 3 revealed
Solution
Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.
Related problems
All problems| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| Johnson–Lindenstrauss dimension arithmetic | High-Dim Probability | Numerical | 15 min | ||
| Derive Hoeffding's inequality from Hoeffding's lemma | High-Dim Probability | Proof | 30 min | ||
| From distance preservation to inner-product preservation | High-Dim Probability | Proof | 30 min | ||
| Implement random projection and measure the distortion run | High-Dim Probability | Coding | 1 hour | ||
| Massart's finite maximal inequality | Learning Theory | Proof | 30 min |