4.0 Article

An efficient algorithm for Elastic I-optimal design of generalized linear models

出版社

WILEY
DOI: 10.1002/cjs.11571

关键词

Fast convergence; multiplicative algorithm; prediction-oriented; sequential algorithm

资金

  1. National Science Foundation
  2. College of Science and Health Faculty Summer Research Grant Program, DePaul University

向作者/读者索取更多资源

Generalized linear models (GLMs) are widely used in statistical analysis, and studying optimal designs for improving prediction accuracy is crucial. This work proposes Elastic I-optimality as a prediction-oriented design criterion for GLMs, develops an efficient algorithm, and conducts numerical examples to evaluate feasibility and computational efficiency.
The generalized linear models (GLMs) are widely used in statistical analysis and the related design issues are undoubtedly challenging. The state-of-the-art works mostly apply to design criteria on the estimates of regression coefficients. The prediction accuracy is usually critical in modern decision-making and artificial intelligence applications. It is of importance to study optimal designs from the prediction aspects for GLMs. In this work, we consider Elastic I-optimality as a prediction-oriented design criterion for GLMs, and develop an efficient algorithm for such EI-optimal designs. By investigating theoretical properties for the optimal weights of any set of design points and extending the general equivalence theorem to the EI-optimality for GLMs, the proposed efficient algorithm adequately combines the Fedorov-Wynn algorithm and the multiplicative algorithm. It achieves great computational efficiency with guaranteed convergence. Numerical examples are conducted to evaluate the feasibility and computational efficiency of the proposed algorithm.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.0
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据