Talagrand's majorizing measure theory: Lower bounds VIDEO
We will present Talagrand's majorizing measure theory, which gives tight estimates for maxima of Gaussian processes, including the full proof and an extension to a weak version of the Bernoulli conjecture. This is the second lecture in a series specifically designed to be accessible to beginners in the field. The format will be informal and questions will be encouraged Further lectures will be scheduled later to discuss more advanced aspects.
Other Videos By Microsoft Research 2016-08-17 Project Hawaii: Resources for Teaching Mobile + Cloud Computing 2016-08-17 A New Approach to Concurrency and Parallelism 2016-08-17 Latest Advances in Bing Maps User Experience and Ecosystem 2016-08-17 Talagrand's majorizing measure theorem: The proof 2016-08-17 Code Contracts and Pex: Infrastructure for Dynamic and Static Analysis for .NET 2016-08-17 Beneath the Surface: Introduction and Projects 2016-08-17 Design Expo - Farmbridge - New York University, New York City, NY 2016-08-17 Design Expo - Open Door - University of Washington, Seattle, WA 2016-08-17 Design Expo - Data Hungry Skin - Connections in Faraday 2016-08-17 Visualization and Interaction Today-Selected Perspectives 2016-08-17 Talagrand's majorizing measure theory: Lower bounds 2016-08-17 Design Expo - Kueponi - Universidad Iberoamerica, Mexico City, Mexico 2016-08-17 An Economic View Usable Security 2016-08-17 Design Expo - GURU - Carnegie Mellon University, Pittsburgh, PA 2016-08-17 Environmental Data Management 2016-08-17 Bing Dialog Model: Intent, Knowledge, and User Interaction 2016-08-17 Cutting Edge Education Update 2016-08-17 Software Ecosystems: A New Research Agenda 2016-08-17 Message Passing Algorithms: A Success Looking for Theoreticians 2016-08-17 Improving Privacy on Social Network Sites 2016-08-17 Memento: Time Travel for the Web
8