Simons Institute for the Theory of Computing
453 old videos with fewer than 5,000 views from this channel.
-
50:04
High Dimensional Expanders and PCPs
-
56:53
Random Walks on Ramanujan Graphs, Digraphs and Complexes
-
46:39
What are High-Dimensional Expanders?
-
48:44
Finding and Using Expanders in Locally Sparse Graphs and in Sparse Random Graphs
-
43:52
Spectral Gaps and Geometric Representations
-
41:59
Improved Deterministic Randomness Extraction from Non-Binary Santha-Vazirani Sources
-
1:04:53
Machine Teaching in Interactive Learning
-
48:05
Interactively Learning Robot Objective Functions
-
47:16
Stochastic Variance Reduction Methods for Policy Evaluation
-
47:33
Active Learning Beyond Label Feedback
-
58:48
Sample-Efficient Reinforcement Learning with Rich Observations
-
59:04
Does Randomness Solve Problems?
-
1:11:57
Interactive Learning of Parsers from Weak Supervision
-
43:39
Hierarchical Learning for Human-Robot Collaboration
-
49:37
Active Nearest-Neighbor Learning in Metric Spaces
-
1:15:22
Finding Hay in Haystacks: The Power and Limits of Randomness
-
34:00
The Uncanny Usefulness of Constructive Proofs of Pseudorandomness
-
1:00:35
Packing Degenerate Graphs Using Pseudorandomness
-
31:43
Regularity Inheritance in Pseudorandom Graphs
-
36:27
The Number of B_h-sets of a Given Cardinality
-
57:05
Removal Lemmas with Polynomial Bounds
-
1:01:25
Forcing Quasirandomness with Triangles
-
1:04:49
Explicit, Almost Optimal, Epsilon-Balanced Codes
-
30:54
Algorithmic Regularity Lemmas and Applications