Automatic Resource Bound Analysis and Linear Optimization

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


Duration: 48:13
210 views
1

Jan Hoffmann, Carnegie Mellon University
https://simons.berkeley.edu/talks/jan-hoffmann-2016-11-15
Learning, Algorithm Design and Beyond Worst-Case Analysis



Other Videos By Simons Institute for the Theory of Computing


2016-11-17Beyond Worst Case: When Complex Feedback Can Improve the Label Complexity of Active Learning
2016-11-17Characterizing the Typical Case Complexity of Formal Verification and Synthesis
2016-11-17Recovery Guarantee of Non-Negative Matrix Factorization via Alternating Updates
2016-11-17The Logic of Counting Query Answers
2016-11-16The Computational Benefit of Correlated Instances
2016-11-16Learning as a Tool for Algorithm Design and Beyond-Worst-Case Analysis
2016-11-16Learning the Best Agorithm for Max-Cut, Clustering, and Other​ ​Partitioning Problems
2016-11-16Beyond Big-O: Statistical Analysis of Performance Scaling
2016-11-16Self-Improving Algorithms for Sorting and Geometric Problems
2016-11-16A PAC Approach to Application-Specific Algorithm Selection
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


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