Lucky Talk: An Algorithmic Characterization of a Class of Inequalities

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


Duration: 23:26
705 views
4

Gregory Valiant, Stanford University
Information Theory, Learning and Big Data
http://simons.berkeley.edu/talks/gregory-valiant-2015-03-20



Other Videos By Simons Institute for the Theory of Computing


2015-04-27Relative Discrepancy Does Not Separate Information and Communication Complexity
2015-04-27A New Look at Gallager's Bounds
2015-04-27Information Complexity is Computable
2015-04-27On Parallelizing Streaming Algorithms
2015-04-27Combinatorial Proofs of Concentration Bounds
2015-04-27On Geometric Measures for Information Complexity
2015-04-27Tribes is Hard in the Message Passing Model
2015-04-27How to Compress Asymmetric Communication
2015-04-27Do Read Errors Matter for DNA Assembly?
2015-04-08Interactive Information: Applications and New Directions
2015-03-25Lucky Talk: An Algorithmic Characterization of a Class of Inequalities
2015-03-25Strong Data Processing Inequalities and Estimation with Constraints
2015-03-25Low-Rank Matrix Recovery Through Rank-One Projections
2015-03-25Adaptive Coding over Countable Alphabets
2015-03-25Fundamental Limit of Community Detection in Stochastic Block Models
2015-03-25Constrained Rank Aggregation and Correlation Clustering
2015-03-25Sample Complexity of Estimating Entropy
2015-03-25Machine Learning from Human Comparative Judgments
2015-03-25Minimum Rényi Correlation Principle: From Marginals to Joint Distribution
2015-03-25Near-Optimal Hypothesis Testing via Convex Optimization
2015-03-25Sketching for M-Estimators: A Unified Approach to Robust Regression


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Information Theory
Gregory Valiant