High-Dimensional Convexity: Testing, Learning, and Complexity

High-Dimensional Convexity: Testing, Learning, and Complexity

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it 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.