The Effectiveness of Convex Programming in the Information and Physical Sciences

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


Duration: 1:11:33
2,512 views
44

Emmanuel Candès, Stanford University
Simons Institute Open Lectures
http://simons.berkeley.edu/events/openlectures2013-fall-2



Other Videos By Simons Institute for the Theory of Computing


2013-10-28Implementing Randomized Matrix Algorithms in Parallel and Distributed Environments
2013-10-28Communication-Optimal Parallel Algorithm for Strassen's Matrix Multiplication
2013-10-28Big Data on Smallish Machines
2013-10-28Sampling Algorithms to Count Frequent Patterns in Graphs
2013-10-28MLbase: A Distributed Machine Learning System
2013-10-28Extreme Multiclass
2013-10-28Cost Models for Locality and Parallelism
2013-10-28Scalable Graph-Parallel Inference Algorithms and Systems
2013-10-28Large Scale Response Prediction to Serve Ads on LinkedIn
2013-10-28MapReduce Algorithmics
2013-10-23The Effectiveness of Convex Programming in the Information and Physical Sciences
2013-10-09Influences in Gaussian Space
2013-10-09Reversing Hypercontractivity
2013-10-09A Two-Sided Estimate for the Gaussian Noise Stability Deficit
2013-10-09Majority is Stablest for Dependent Variables
2013-10-09Strong Noise Sensitivity and Random Graphs
2013-10-09Noise Stability and Central Limit Theorem for Random Effective Resistance
2013-10-09Approximations of Submodular, XOS and Self-Bounding Functions by Juntas
2013-10-09A Removal Lemma for Kneser Graphs and Product Graphs
2013-10-09On Hyperboundedness and Spectrum of Markov Operators
2013-10-09Two Generalizations of Cheeger's Inequality


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Emmanuel Candès