Watch a 49-minute mathematics lecture exploring the parallels between algorithmic and structural aspects of high-dimensional convex sets over Gaussian space and monotone Boolean functions over {0,1}^n. Delve into groundbreaking research conducted in collaboration with Anindya De and Rocco Servedio that investigates this powerful yet not fully understood analogy in mathematical theory. Learn about the testing, learning, and complexity aspects of high-dimensional convexity through detailed explanations and mathematical insights presented by Shivam Nadimpalli at the Hausdorff Center for Mathematics.
High-Dimensional Convexity: Testing, Learning, and Complexity
Hausdorff Center for Mathematics via YouTube
Overview
Syllabus
Shivam Nadimpalli: High-dimensional convexity: testing, learning, and complexity
Taught by
Hausdorff Center for Mathematics
Related Courses
-
Sparsifying Suprema of Gaussian Processes
-
Isoperimetric Inequalities in High Dimensional Convex Sets - Lecture 4 Part 1
-
Ronen Eldan- Revealing the Simplicity of High-Dimensional Objects via Pathwise Analysis
-
Isoperimetric Inequalities in High Dimensional Convex Sets - Lecture 4 Part 4
-
Facets of High Dimensional Random Polytopes
-
The Large Deviations Approach to High-Dimensional Convex Bodies - Lecture I
