A Brief Intro to Analysis Beyond the Worst Case

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


Duration: 40:42
1,942 views
18

Avrim Blum, Carnegie Mellon University
https://simons.berkeley.edu/talks/avrim-blum-2016-11-14
Learning, Algorithm Design and Beyond Worst-Case Analysis



Other Videos By Simons Institute for the Theory of Computing


2016-11-15Automatic Resource Bound Analysis and Linear Optimization
2016-11-15A Theoretical Approach to Semantic Coding and Hashing
2016-11-15Timing Matters: Online Dynamics in Broadcast Games
2016-11-15Distribution-Specific Analysis of Nearest Neighbor Search and Classification
2016-11-15Spectral Approaches to Nearest Neighbor Search
2016-11-14Applied Mixed Integer Programming: Beyond 'The Optimum'
2016-11-14Analyzing Algorithms on Real World Data
2016-11-14On the Effect of Randomness on Planted 3-Coloring Models
2016-11-14Clustering Under Perturbation Resilience
2016-11-14Learning Probabilistic Models for Graph Partitioning in the Presence of Noise
2016-11-14A Brief Intro to Analysis Beyond the Worst Case
2016-11-10Testing Assignments to Constraint Satisfaction Problems
2016-11-10The Expressiveness of Recognizability by Orbite Finite Nominal Monoids
2016-11-10Logics of Finite Hankel Rank
2016-11-10Near-Optimal Expanding Generating Sets for Solvable Permutation Groups
2016-11-10Symmetry-Preserving Finite Synthesis and Amalgamation
2016-11-10Logic in Computer Science, Engineering and Industry
2016-11-10Functional Programming Over Sets with Atoms
2016-11-10Logic and Bisimulation for Guarded Teams
2016-11-09Braid Groups, Hecke Algebras, Representations, and Anyons
2016-11-09FO-Definable Constraint Satisfaction Problems


Tags:
Learning Algorithm Design and Beyond Worst-Case Analysis
Avrim Blum
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley