Sparse Polynomial Interpolation: Compressed Sensing, Super-resolution, or Prony?

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


Duration: 30:26
756 views
7

Jean-Bernard Lasserre, CNRS
https://simons.berkeley.edu/talks/jean-bernard-lasserre-11-6-17
Hierarchies, Extended Formulations and Matrix-Analytic Techniques



Other Videos By Simons Institute for the Theory of Computing


2017-11-08Counting and Optimization Using Stable Polynomials
2017-11-08Spectrahedra and Directional Derivatives of Determinants
2017-11-08Maximizing Sub-determinants and Connections to Permanents and Inequalities on Stable Polynomials
2017-11-08SOS and the Dreaded Bit-complexity
2017-11-07Matrix Completion and Sums of Squares
2017-11-07LP, SOCP, and Optimization-Free Approaches to Polynomial Optimization
2017-11-07From Weak to Strong LP Gaps for all CSPs
2017-11-07Spectral Aspects of Symmetric Matrix Signings
2017-11-07Weak Decoupling, Polynomial Folds, and Approximate Optimization over the Sphere
2017-11-07Pseudocalibration and SoS Lower Bounds
2017-11-06Sparse Polynomial Interpolation: Compressed Sensing, Super-resolution, or Prony?
2017-11-06Using Symmetry in Semidefinite Programming
2017-11-06Bounds for Matrix Factorization Ranks via Semidefinite Programming and...
2017-11-06A Lower Bound on the Positive Semidefinite Rank of Convex Bodies
2017-11-06Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
2017-11-06Small (Explicit) Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
2017-11-06Constructing Extended Formulations
2017-11-01Lower Bounds on the Size of Linear Programs
2017-10-27Black Holes, Firewalls, and the Limits of Quantum Computers
2017-10-06Natasha 2: Faster Non-convex Optimization Than SGD
2017-10-06From Minimum Cut to Submodular Minimization: Leveraging the Decomposable Structure


Tags:
Jean-Bernard Lasserre
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Hierarchies Extended Formulations and Matrix-Analytic Techniques