Optimal Design of Multifactor Experiments via Grid Exploration

04/08/2021
by   Radoslav Harman, et al.
0

For computing efficient approximate designs of multifactor experiments, we propose a simple algorithm based on adaptive exploration of the grid of all combinations of factor levels. We demonstrate that the algorithm significantly outperforms several state-of-the-art competitors for problems with discrete, continuous, as well as mixed factors. Importantly, we provide a free R code that permits direct verification of the numerical results and allows the researchers to easily compute optimal or nearly-optimal experimental designs for their own statistical models.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/25/2021

Efficient computational algorithms for approximate optimal designs

In this paper, we propose two simple yet efficient computational algorit...
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...
04/08/2018

Efficient Computational Algorithm for Optimal Continuous Experimental Designs

A simple yet efficient computational algorithm for computing the continu...
11/12/2021

G-optimal grid designs for kriging models

This work is focused on finding G-optimal designs theoretically for krig...
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...
01/09/2022

Computing optimal experimental designs on finite sets by log-determinant gradient flow

Optimal experimental designs are probability measures with finite suppor...
05/07/2020

The numerical statistical fan for noisy experimental designs

Identifiability of polynomial models is a key requirement for multiple r...
This week in AI

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