Convex Relaxations for Permutation Problems

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


Duration: 47:01
379 views
5

Alexandre d'Aspremont, CNRS - ENS Paris
Succinct Data Representations and Applications
http://simons.berkeley.edu/talks/alexandre-d-aspremont-2013-09-18



Other Videos By Simons Institute for the Theory of Computing


2013-10-09Variants of Parseval's Formula and the Grothendieck Inequality
2013-10-09Maximal Inequalities on the Hypercube
2013-10-09On Mimicking Rademacher Sums
2013-10-09A Structure Theorem for Boolean Functions with Small Total Influences
2013-09-27Mixed and Covariate-Dependent Graphical Models
2013-09-27Variable Selection with Error Control: Another Look at Stability Selection
2013-09-27Min-Wise Hashing for Large-Scale Regression and Classification
2013-09-27Noisy Estimation of Simultaneously Structured Models
2013-09-27Memory Limited, Streaming PCA
2013-09-27Computational and Statistical Tradeoffs via Convex Relaxation
2013-09-27Convex Relaxations for Permutation Problems
2013-09-27How (and Why) to "Read" Big Graphs
2013-09-27Going Off the Grid
2013-09-27Structured Sparsity-Inducing Norms Through Submodular Functions
2013-09-27Two Concise Representations for High-Dimensional Visual Data
2013-09-27Optimal Detection of Sparse Signal Segments
2013-09-27Probabilistic Hashing Methods for Succinct Data Representations and Applications
2013-09-27Dimensionality Reduction Via Sparse Matrices
2013-09-27Succinct Representations and Efficient Algorithms Based on Linear Programming
2013-09-27Inferring Structural Properties: Graphs and Bridges
2013-09-27Fast Testing of Graph Properties


Tags:
Simons Institute
Big Data
UC Berkeley
computer science
theory of computing
Alexandre d'Aspremont