.png){kind=icon}
.png){kind=icon}
Return
APPROXIMATE OPTIMAL DESIGNS FOR MULTIVARIATE POLYNOMIAL REGRESSION
.png){kind=icon}
OA
AI
DOI：10.1214/18-AOS1683.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce a new approach aiming at computing approximate optimal designs for multivariate polynomial regressions on compact (semialgebraic) design spaces. We use the moment-sum-of-squares hierarchy of semidefinite programming problems to solve numerically the approximate optimal design problem. The geometry of the design is recovered via semidefinite programming duality theory. This article shows that the hierarchy converges to the approximate optimal design as the order of the hierarchy increases. Furthermore, we provide a dual certificate ensuring finite convergence of the hierarchy and showing that the approximate optimal design can be computed numerically with our method. As a byproduct, we revisit the equivalence theorem of the experimental design theory: it is linked to the Christoffel polynomial and it characterizes finite convergence of the moment-sum-of-square hierarchies.
Keywords:
Experimental design
semidefinite programming
Christoffel polynomial
linear model
equivalence theorem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.7
Papers:
2.8K
Citations:
2.9W
Organization
View more organizations