Near-Optimal Hypothesis Testing via Convex Optimization

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


Duration: 27:53
1,071 views
9

Arkadi Nemirovski, Georgia Institute of Technology
Information Theory, Learning and Big Data
http://simons.berkeley.edu/talks/arkadi-nemirovski-2015-03-18



Other Videos By Simons Institute for the Theory of Computing


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-25Near-Optimal Hypothesis Testing via Convex Optimization
2015-03-25Efficient Minimax Optimal Strategies for Universal Prediction
2015-03-25Simple, Efficient and Neural Algorithms for Sparse Coding
2015-03-25Lucky Talk: Chebyshev Polynomials, Moment Matching and Optimal Estimation of the Unseen
2015-03-25Information Measure Estimation and Applications: Boosting the Sample Size from n to n log n
2015-03-25Nearest Neighbor Based Greedy Coordinate Descent
2015-03-25Tradeoffs in Large Scale Learning: Statistical Accuracy vs. Numerical Precision
2015-03-25Spy vs Spy: Anonymous Messaging
2015-03-25Must One Learn the Channel to Communicate at Capacity?
2015-03-25Low Regret Recommendations and Item-Item Collaborative Filtering
2015-03-25Topic Modeling Approach for Rank Aggregation


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Information Theory
Arkadi Nemirovski