Completed
Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers 9:45-
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Algorithmic Learning Theory Research Presentations - Session 6
Automatically move to the next video in the Classroom when playback concludes
- 1 On the Hardness of Learning Regular Expressions -9:43
- 2 Large Average Subtensor Problem: Ground-State, Algorithms, and Algorithmic Barriers 9:45-
- 3 The Planted Number Partitioning Problem 21:12-
- 4 Uniform Convergence Beyond Glivenko-Cantelli 33:47-
- 5 Optimal Bounds for Tyler’s M-Estimator for Elliptical Distributions 44:22-
- 6 Talagrand Meets Talagrand: Upper and Lower Bounds on Expected Soft Maxima of Gaussian Processes with Finite Index Sets 56:43-
