Sampling Algorithms for Combinatorial Pure Exploration

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=OyGb6WjfZ7A


Duration: 29:27
1,174 views
7

Anupam Gupta, Carnegie Mellon University
https://simons.berkeley.edu/talks/anupam-gupta-11-30-17
Optimization, Statistics and Uncertainty



Other Videos By Simons Institute for the Theory of Computing


2018-01-16Allen Institute Large-scale Datasets and Modeling Tools
2018-01-16High Throughput Connectomics
2018-01-16Mapping Neural Connections and Their Development II
2018-01-16Mapping Neural Connections and Their Development I
2017-12-22Cryptography: How to Enable Privacy in a Data-Driven World
2017-12-22Oral History: Russell Impagliazzo in Conversation with Dick Karp
2017-12-13Gradient Descent: The Mother of All Algorithms?
2017-12-01Accuracy First: Selecting a Differential Privacy Level for Accuracy-Constrained...
2017-12-01Stability and Convergence Trade-Off of Iterative Optimization Algorithms
2017-12-01Compositional Properties of Statistical Procedures: An Information-Theoretic View
2017-11-30Sampling Algorithms for Combinatorial Pure Exploration
2017-11-30The Power and Limitations of Kernel Learning
2017-11-30Optimization's Untold Gift to Learning: Implicit Regularization
2017-11-30Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe
2017-11-30On Approximation Guarantees for Greedy Low Rank Optimization
2017-11-30Graph Powering
2017-11-29Low-rank Matrix Completion: Adaptive Sampling Can Help When, How?
2017-11-29Fireside Chat with Simons Institute Director Dick Karp
2017-11-29Implicit Regularization in Nonconvex Statistical Estimation
2017-11-29A Few Connections Between Optimization and Probability
2017-11-29An Instability in Variational Methods for Learning Topic Models


Tags:
Anupam Gupta
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Optimization Statistics and Uncertainty