An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices

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


Duration: 50:46
417 views
3

Shravas Rao, Northwestern University
https://simons.berkeley.edu/talks/improved-lower-bound-sparse-reconstruction-subsampled-hadamard-matrices
Concentration of Measure Phenomena



Other Videos By Simons Institute for the Theory of Computing


2020-10-23Log Concavity and Concentration of Measure on the Discrete Hypercube
2020-10-22Sharp Poincare and log-Sobolev Inequalities for the Switch Chain on Regular Bipartite Graphs
2020-10-22Rates of Normal Approximation for Typical Weighted Sums
2020-10-22The Langevin Algorithm in the Non Smooth Log-Concave Case
2020-10-22Moments of the Distance Between Independent Random Vectors
2020-10-21Sharp Thresholds for Random Subspaces, and Applications
2020-10-21Gaussian Regularization of the Pseudospectrum and Numerical Linear Algebra
2020-10-21Reducing Isotropy to KLS, A Faster Sampling Algorithm
2020-10-21Random Concave Functions on an Equilateral Lattice with Periodic Hessians
2020-10-20Recent Advances in Algorithmic Heavy-Tailed Statistics
2020-10-20An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices
2020-10-20On Some Brunn-Minkowski Inequalities for Probability Measures Under Symmetry
2020-10-20Poincaré Inequalities and Convergence to Equilibrium with Variable Curvature Bounds
2020-10-20Sharp Isoperimetric Inequalities for Affine Quermassintegrals
2020-10-19A Probabilistic Mechanism for Quark Confinement
2020-10-19From Gaussian Measure to Partial Colorings and Linear Size Sparsifiers
2020-10-19Projections of Probability Distributions: A Measure-Theoretic Dvoretzky Theorem
2020-10-19Aspects of Coulomb Gases
2020-10-19Tail and Moment Bounds for Gaussian Chaoses in Banach Spaces
2020-10-14The Ethical Algorithm
2020-10-12New Tools for Analysis of Markov Chains via High-Dimensional Expansion


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Shravas Rao
Concentration of Measure Phenomena