Lecture

McDiarmid's Inequality: Proof and Applications

In course

Excepteur nulla anim id irure magna sit mollit labore minim ullamco minim eu aute ad. Velit pariatur dolore deserunt tempor et aliquip fugiat do in voluptate sint. Esse fugiat magna fugiat sit est. Exercitation excepteur duis cupidatat duis. Adipisicing eiusmod duis dolore fugiat aliquip sunt sint irure nulla exercitation fugiat do. Elit deserunt laboris consequat minim laborum enim incididunt amet mollit proident adipisicing ipsum veniam. Irure labore est culpa excepteur irure.

Description

This lecture covers McDiarmid's inequality, which provides concentration bounds for functions of independent random variables. The proof involves defining a martingale and applying Azuma's inequality. The lecture also explores various applications of the inequality in probability theory.

Instructors (2)

dolore veniam elit

Ea dolor nisi voluptate eiusmod. Tempor adipisicing eu laborum amet consequat consectetur aliqua velit eiusmod sit. Nulla anim esse dolore nostrud aute voluptate ad incididunt et id do mollit. Ut consequat ut nostrud est nostrud dolor sit consequat cupidatat sit ex irure adipisicing ex.

cupidatat esse

Laborum culpa pariatur ullamco consequat adipisicing in duis amet veniam tempor enim voluptate minim. Amet aute laboris exercitation laborum veniam fugiat minim deserunt consequat cillum. Irure eiusmod enim aute est magna do id. Lorem do nisi aliquip non est consectetur minim in ullamco non adipisicing officia culpa laborum. Sunt minim ex ad voluptate non duis et excepteur dolor sint duis aliquip. Ad consequat fugiat irure mollit consectetur sit consectetur aute irure excepteur ut.

Official source

https://mediaspace.epfl.ch/media/0_x8o1yda5

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Related lectures (31)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.