Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers concentration inequalities, focusing on Hoeffding's inequality. It explains the concept using sequences of independent and integrable random variables, discussing how the probability tends to zero as the sample size increases. The lecture also delves into the proof of Hoeffding's inequality and its consequences, such as the strong law of large numbers and Chebyshev's inequality.