$T$-optimal designs for discrimination between two polynomial models
Holger Dette, Viatcheslav B. Melas, Petr Shpilev

TL;DR
This paper explicitly constructs T-optimal designs for discriminating between polynomial models of degrees n-2 and n, confirming a conjecture about their support points and providing solutions for all degrees n.
Contribution
The paper provides the first explicit solutions for T-optimal designs for any polynomial degree, confirming a conjecture and extending the theory beyond numerical methods.
Findings
Explicit T-optimal designs are derived for all polynomial degrees.
Support points are cosines of equally spaced angles, confirming the conjecture.
A numerical procedure is proposed for cases with different coefficient ratios.
Abstract
This paper is devoted to the explicit construction of optimal designs for discrimination between two polynomial regression models of degree and . In a fundamental paper, Atkinson and Fedorov [Biometrika 62 (1975a) 57--70] proposed the -optimality criterion for this purpose. Recently, Atkinson [MODA 9, Advances in Model-Oriented Design and Analysis (2010) 9--16] determined -optimal designs for polynomials up to degree 6 numerically and based on these results he conjectured that the support points of the optimal design are cosines of the angles that divide half of the circle into equal parts if the coefficient of in the polynomial of larger degree vanishes. In the present paper we give a strong justification of the conjecture and determine all -optimal designs explicitly for any degree . In particular, we show that there exists a one-dimensional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
