Seminar • Algorithms and Complexity • Experimental Design for Any p-Norm

Please note: This half-hour seminar will take place in M3 4206 and online.

Robert Wang, PhD candidate
David R. Cheriton School of Computer Science

We consider a general p-norm objective for experimental design problems that captures some well-studied objectives (D/A/E-design) as special cases. We prove that a randomized local search approach provides a unified algorithm to solve this problem for all p. This provides the first approximation algorithm for the general p-norm objective, and a nice interpolation of the best known bounds of the special cases.

Based on joint work with Lap Chi Lau and Hong Zhou that has appeared in Random 2023.

This is the first of two back-to-back seminars.