Approximation Algorithms for D-optimal Design
Mohit Singh, Weijun Xie

TL;DR
This paper develops the first constant-factor approximation algorithms for the combinatorial D-optimal experimental design problem, addressing both with and without repetitions, and provides analysis of sampling algorithms with near-optimal guarantees.
Contribution
It introduces the first constant-factor approximation algorithms for D-optimal design with and without repetitions, advancing the computational methods for experimental design.
Findings
First $rac{1}{e}$-approximation algorithm for the problem.
Sampling algorithm achieves $(1- ext{epsilon})$-approximation under certain conditions.
Improved approximation ratio for D-optimal design with repetitions.
Abstract
Experimental design is a classical statistics problem and its aim is to estimate an unknown -dimensional vector from linear measurements where a Gaussian noise is introduced in each measurement. For the combinatorial experimental design problem, the goal is to pick out of the given experiments so as to make the most accurate estimate of the unknown parameters, denoted as . In this paper, we will study one of the most robust measures of error estimation - -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 -approximation for the -optimal design problem with and without repetitions, giving the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Optimal Experimental Design Methods · Advanced Multi-Objective Optimization Algorithms
