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

01/09/2022
by   Federico Piazzon, et al.
0

Optimal experimental designs are probability measures with finite support enjoying an optimality property for the computation of least squares estimators. We present an algorithm for computing optimal designs on finite sets based on the long-time asymptotics of the gradient flow of the log-determinant of the so called information matrix. We prove the convergence of the proposed algorithm, and provide a sharp estimate on the rate its convergence. Numerical experiments are performed on few test cases using the new matlab package OptimalDesignComputation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/08/2018

Efficient Computational Algorithm for Optimal Continuous Experimental Designs

A simple yet efficient computational algorithm for computing the continu...
research
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...
research
11/27/2022

Convergence Rate Analysis for Optimal Computing Budget Allocation Algorithms

Ordinal optimization (OO) is a widely-studied technique for optimizing d...
research
01/18/2021

High order efficient algorithm for computation of MHD flow ensembles

In this paper, we propose, analyze, and test a new fully discrete, effic...
research
02/27/2018

On optimal designs for non-regular models

Classically, Fisher information is the relevant object in defining optim...
research
04/08/2021

Optimal Design of Multifactor Experiments via Grid Exploration

For computing efficient approximate designs of multifactor experiments, ...
research
10/18/2022

Convergence Analysis of Volumetric Stretch Energy Minimization and its Associated Optimal Mass Transport

The volumetric stretch energy has been widely applied to the computation...

Please sign up or login with your details

Forgot password? Click here to reset