Explore the intricacies of active lp regression and its broader implications in this hour-long lecture by David Woodruff from Carnegie Mellon University. Delve into optimization and algorithm design concepts as part of the Simons Institute's series on advanced mathematical topics. Gain insights into the latest research on tight bounds and their applications in various computational problems.
Tight Bounds for Active LP Regression and Beyond
Overview
Syllabus
Tight Bounds for Active lp Regression and Beyond
Taught by
Simons Institute
Related Courses
-
Tight Bounds for Volumetric Spanners in All Norms
-
Testing Positive Semidefiniteness and Eigenvalue Approximation
-
Fast Algorithms for Regression Problems
-
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver
-
Optimisation - Linear Integer Programming - Professor Raphael Hauser
-
Power of Active Sampling for Unsupervised Learning
