Efficient computational algorithms for approximate optimal designs

02/25/2021
by   Jiangtao Duan, et al.
0

In this paper, we propose two simple yet efficient computational algorithms to obtain approximate optimal designs for multi-dimensional linear regression on a large variety of design spaces. We focus on the two commonly used optimal criteria, D- and A-optimal criteria. For D-optimality, we provide an alternative proof for the monotonic convergence for D-optimal criterion and propose an efficient computational algorithm to obtain the approximate D-optimal design. We further show that the proposed algorithm converges to the D-optimal design, and then prove that the approximate D-optimal design converges to the continuous D-optimal design under certain conditions. For A-optimality, we provide an efficient algorithm to obtain approximate A-optimal design and conjecture the monotonicity of the proposed algorithm. Numerical comparisons suggest that the proposed algorithms perform well and they are comparable or superior to some existing algorithms.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/08/2018

Efficient Computational Algorithm for Optimal Continuous Experimental Designs

A simple yet efficient computational algorithm for computing the continu...
01/17/2018

A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments

We propose a class of subspace ascent methods for computing optimal appr...
08/02/2018

Removal of the points that do not support an E-optimal experimental design

We propose a method of removal of design points that cannot support any ...
01/27/2018

Ascent with Quadratic Assistance for the Construction of Exact Experimental Designs

In the area of experimental design, there is a large body of theoretical...
04/08/2021

Optimal Design of Multifactor Experiments via Grid Exploration

For computing efficient approximate designs of multifactor experiments, ...
06/10/2019

Bayesian experimental design using regularized determinantal point processes

In experimental design, we are given n vectors in d dimensions, and our ...
01/15/2021

An Adaptive Algorithm based on High-Dimensional Function Approximation to obtain Optimal Designs

Algorithms which compute locally optimal continuous designs often rely o...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.