• Corpus ID: 245836827

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

  title={Computing optimal experimental designs on finite sets by log-determinant gradient flow},
  author={Federico Piazzon},
  • F. Piazzon
  • Published 9 January 2022
  • Computer Science, Mathematics
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… 

Figures from this paper


Approximate Optimal Designs for Multivariate Polynomial Regression
It is shown that the hierarchy converges to the approximate optimal design as the order of the hierarchy increases, and the equivalence theorem of the experimental design theory is revisited: it is linked to the Christoffel polynomial and it characterizes finite convergence of the moment-sum-of-square hierarchies.
Monotonic convergence of a general algorithm for computing optimal designs
Monotonic convergence is established for a general class of multiplicative algorithms introduced by Silvey, Titterington and Torsney for computing optimal designs.
Near G-optimal Tchakaloff designs
We show that the notion of polynomial mesh (norming set), used to provide discretizations of a compact set nearly optimal for certain approximation theoretic purposes, can also be used to obtain
Optimal design of multifactor experiments via grid exploration
A simple algorithm based on adaptive exploration of the grid of all combinations of factor levels that significantly outperforms several state-of-the-art competitors for problems with discrete, continuous, as well as mixed factors is proposed.
Fast Computation of Exact G-Optimal Designs Via Iλ-Optimality
This article develops a new method for constructing exact G-optimal designs using the integrated variance criterion, Iλ-optimality, and demonstrates the use of the algorithm for full quadratic models in one to five factors.
On the Convergence of Optimal Measures
Using recent results of Berman and Boucksom (arXiv:0807.0035), we show that for a nonpluripolar compact set K⊂ℂd and an admissible weight function w=e−φ, any sequence of optimal measures converges
Optimum Designs in Regression Problems
0. Summary. Extending the results of Kiefer and Wolfowitz [10], [11], methods are obtained for characterizing and computing optimum regression designs in various settings, and examples are given
An algorithm for optimal designs on a design space
Two variations of a simple monotunic algorithm for computing optimal designs on a finite design space are presented. Various properties are listed. Comparisons witn other algorithms are made.
Suboptimal Polynomial Meshes on Planar Lipschitz Domains
We construct norming meshes with cardinality 𝒪(n s ), s = 3, for polynomials of total degree at most n on the closure of bounded planar Lipschitz domains. Such cardinality is intermediate between