Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2507.23240 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917352030863360 |
|---|---|
| author | Yang, Yingying Chen, Xiaotian Yang, Jie |
| author_facet | Yang, Yingying Chen, Xiaotian Yang, Jie |
| contents | 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 regions get involved, we develop a ForLion algorithm that is guaranteed to find A-optimal designs with mixed factors. Numerical studies show that our algorithms can find highly efficient designs with reduced numbers of distinct experimental settings, which may save both experimental time and cost significantly. Along with a rounding-off algorithm that converts approximate allocations to exact ones, we demonstrate that stratified samplers based on A-optimal allocations may provide more accurate parameter estimates than commonly used samplers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_23240 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A-optimal Designs under Generalized Linear Models Yang, Yingying Chen, Xiaotian Yang, Jie Methodology Computation 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 regions get involved, we develop a ForLion algorithm that is guaranteed to find A-optimal designs with mixed factors. Numerical studies show that our algorithms can find highly efficient designs with reduced numbers of distinct experimental settings, which may save both experimental time and cost significantly. Along with a rounding-off algorithm that converts approximate allocations to exact ones, we demonstrate that stratified samplers based on A-optimal allocations may provide more accurate parameter estimates than commonly used samplers. |
| title | A-optimal Designs under Generalized Linear Models |
| topic | Methodology Computation |
| url | https://arxiv.org/abs/2507.23240 |