A-optimal Designs under Generalized Linear Models
Yingying Yang, Xiaotian Chen, Jie Yang

TL;DR
This paper develops theoretical characterizations and efficient algorithms for A-optimal experimental designs under generalized linear models, improving design efficiency and reducing costs in practical experiments.
Contribution
It introduces novel algorithms, including lift-one and ForLion, for identifying A-optimal designs with mixed factors, and provides theoretical insights into their properties.
Findings
Algorithms outperform existing methods in efficiency.
Designs reduce experimental settings and costs.
Stratified sampling improves parameter estimation accuracy.
Abstract
Designing efficient experiments under practical constraints is critical in both scientific research and industrial practice. Focusing on minimizing the average variance of the parameter estimates, A-optimal designs show advantages in screening factors and reducing prediction errors. Compared with other criteria, however, algorithms and software for generating A-optimal designs are scarce. In this paper, we characterize A-optimal designs under generalized linear models theoretically and develop efficient algorithms for identifying them. When a predetermined finite set of experimental settings is given, we derive analytic solutions or establish necessary and sufficient conditions for obtaining A-optimal approximate allocations. We show that a lift-one algorithm based on our formulae outperforms commonly used algorithms for finding A-optimal allocations. When continuous factors or design…
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.
Taxonomy
TopicsOptimal Experimental Design Methods · Advanced Multi-Objective Optimization Algorithms · Manufacturing Process and Optimization
