Explore a 42-minute lecture by Eric Price from the University of Texas at Austin on adaptive sparse recovery with limited adaptivity. Delve into the intricacies of sublinear algorithms and nearest-neighbor search as part of the Simons Institute's series on advanced computational concepts. Gain insights into the challenges and solutions in sparse recovery techniques, focusing on scenarios where adaptivity is constrained.
Adaptive Sparse Recovery with Limited Adaptivity
Overview
Syllabus
Adaptive Sparse Recovery with Limited Adaptivity
Taught by
Simons Institute
Related Courses
-
High Dimensional Robust Sparse Regression
-
Learning-Augmented Sketches for Frequency Estimation
-
O(log s)-Approximate Nearest Neighbor Search for Earth Mover's Distance
-
Sparse Matrices in Sparse Analysis - Anna Gilbert
-
Graph-Based Approximate Nearest Neighbors and HNSW
-
A Bi-metric Framework for Fast Similarity Search
