YoVDO

Concentration on HDX: Derandomization Beyond Chernoff - Lecture

Offered By: Institute for Advanced Study via YouTube

Tags

Theoretical Computer Science Courses Graph Theory Courses Complexity Theory Courses Probability Theory Courses Derandomization Courses Concentration Inequalities Courses High Dimensional Expanders Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a cutting-edge computer science and discrete mathematics seminar on concentration bounds and derandomization techniques. Delve into the evolution of Chernoff's bound, from the Expander-Chernoff Theorem to high-dimensional expanders (HDX). Examine the limitations of expander walks for higher degree functions and discover how HDX offer a solution for achieving stronger concentration results. Investigate the implications of these advancements for agreement testing, probabilistically checkable proofs (PCPs), and reverse hypercontractivity. Learn about the latest research closing the gap between HDX and complete hypergraph concentration bounds, presented by Max Hopkins from the Institute for Advanced Study.

Syllabus

Concentration on HDX: Derandomization Beyond Chernoff - Max Hopkins


Taught by

Institute for Advanced Study

Related Courses

The Next Generation of Infrastructure
Delft University of Technology via edX The Beauty and Joy of Computing - AP® CS Principles Part 2
University of California, Berkeley via edX Advanced Data Structures in Java
University of California, San Diego via Coursera Theory of Computation
Indian Institute of Technology Kanpur via Swayam 离散数学
Shanghai Jiao Tong University via Coursera