Sparse Matrices in Sparse Analysis - Anna Gilbert
Offered By: Institute for Advanced Study via YouTube
Course Description
Overview
Explore the intricacies of sparse matrices in sparse analysis through this comprehensive lecture by Anna Gilbert from the University of Michigan. Delve into compressive sensing and sparse signal recovery, examining the design problem and its parameters. Discover two distinct approaches, with a focus on sparse matrices and expander graphs. Investigate applications ranging from polynomials to iPads, and learn about metric repair, including formal definitions and traditional techniques. Analyze three repair scenarios, including constraining P, and explore algorithms for increase-only metric repair. Gain valuable insights into this advanced mathematical topic presented at the Institute for Advanced Study's Members' Seminar.
Syllabus
Intro
Compressive sensing: sparse signal recovery
Design problem
Parameters
Two approaches
Sparse matrices: Expander graphs
Applications: From polynomials to iPads
Definitions
Metric Repair Formally
Traditional Techniques
Three Repair Scenarios: Constrain P
Increase Only Metric Repair: Algorithms
Taught by
Institute for Advanced Study
Related Courses
Graph Partitioning and ExpandersStanford University via NovoEd Dinur's PCP- Degree-Reduction, Expanderizing, Mini-PCP - Lecture 27c of CS Theory Toolkit
Ryan O'Donnell via YouTube Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit
Ryan O'Donnell via YouTube Expanding Across Time to Deliver Bandwidth Efficiency and Low Latency
USENIX via YouTube DistCache - Provable Load Balancing for Large-Scale Storage Systems with Distributed Caching
USENIX via YouTube