How to do CS Theory
35:51Street Fighting Mathematics
26:10Big O and friends
28:10Harmonic Numbers Asymptotics
22:18Asymptotics Tricks
25:00The Central Binomial Coefficient
1:00:26Birthday Paradox Asymptotics
18:09Factorial Asymptotics, Stirling's Formula
28:26Binomial Coefficients Asymptotics
35:57Central Limit Theorem
24:22Gaussian Random Variables
38:31Berry --Esseen Theorem
16:07Markov and Chebyshev Inequalities
38:22Proof of the Chernoff Bound
24:34Chernoff, Hoeffding, etc. bounds
17:47Computational Models: Turing Machines
25:31Computational Models: Circuits
29:07The Word RAM Model
25:30Chernoff, Hoeffding, etc. bounds
This session outlines the general statements of Chernoff and Hoeffding bounds, exploring concepts like negative association and the 'Sampling Theorem' for estimating means.
General statement of Chernoff and Hoeffding bounds, plus comments on negative association and the "Sampling Theorem" for estimating the mean of a random variable. Lecture 5c of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resources for this lecture:
Chapter 2, "Basic tail and concentration bounds" of Wainwright's book "High dimensional statistics"
Proof of the Chernoff Bound
Next · Lecture 16Computational Models: Turing Machines