Sampling Polytopes: From Euclid to Riemann
2,056 views · Published 2 May 2017 · 48:31 · Indexed 8 November 2026
Channel: Simons Institute for the Theory of Computing · 2017 · Education
Yin Tat Lee, Microsoft Research and University of Washington Computational Challenges in Machine Learning https://simons.berkeley.edu/talks/yin-tat-lee-2017-5-2
More from this channel
-
35:16
Probabilistic Polynomials and Hamming Nearest Neighbors
-
15:16
Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
-
55:22
Thinking Algorithmically About Impossibility
-
27:28
The Query Complexity of Correlated Equilibria
-
31:37
Robustness and Separation in Multidimensional Mechanism Design
-
33:01
Revenue Maximization in Interdependent Value Settings
-
34:31
Algorithmic Bayesian Mechanism Design
-
37:51
On Maximizing Revenue for Multi-Item Auctions