An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 20-minute IEEE conference talk that delves into the mathematical intricacies of sparse reconstruction using subsampled Hadamard matrices. Learn about the latest advancements in lower bound calculations presented by researchers Jaroslaw Blasiok, Patrick Lopatto, Kyle Luh, Jake Marcinek, and Shravas Rao. Gain insights into the theoretical foundations and practical implications of this improved lower bound for sparse reconstruction techniques.
Syllabus
An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Fundamentals of Electrical Engineering
Rice University via Coursera Computational Neuroscience
University of Washington via Coursera Introduction to Complexity
Santa Fe Institute via Complexity Explorer Tutorials for Complex Systems
Santa Fe Institute via Complexity Explorer