%ASingh, Mohit%AXie, Weijun%Anull Ed.%BJournal Name: Mathematics of Operations Research; Journal Volume: 45; Journal Issue: 4
%D2020%I
%JJournal Name: Mathematics of Operations Research; Journal Volume: 45; Journal Issue: 4
%K
%MOSTI ID: 10300810
%PMedium: X; Size: 1512 to 1534
%TApproximation Algorithms for *D* -optimal Design
%XExperimental design is a classical statistics problem, and its aim is to estimate an unknown vector from linear measurements where a Gaussian noise is introduced in each measurement. For the combinatorial experimental design problem, the goal is to pick a subset of experiments so as to make the most accurate estimate of the unknown parameters. In this paper, we will study one of the most robust measures of error estimationâ€”the D-optimality criterion, which corresponds to minimizing the volume of the confidence ellipsoid for the estimation error. The problem gives rise to two natural variants depending on whether repetitions of experiments are allowed or not. We first propose an approximation algorithm with a 1/e-approximation for the D-optimal design problem with and without repetitions, giving the first constant-factor approximation for the problem. We then analyze another sampling approximation algorithm and prove that it is asymptotically optimal. Finally, for D-optimal design with repetitions, we study a different algorithm proposed by the literature and show that it can improve this asymptotic approximation ratio. All the sampling algorithms studied in this paper are shown to admit polynomial-time deterministic implementations.
%0Journal Article