|
| | | | |
| | | |
| Stat |
Members: 3669
Articles: 2'599'751
Articles rated: 2609
16 March 2025 |
|
| | | | |
|
Article overview
| |
|
|
Efficient computation of Bayesian optimal discriminating designs | | Holger Dette
; Roman Guchenko
; Viatcheslav B. Melas
; | | Date: |
2 Aug 2015 | | Abstract: | An efficient algorithm for the determination of Bayesian optimal
discriminating designs for competing regression models is developed, where the
main focus is on models with general distributional assumptions beyond the
"classical" case of normally distributed homoscedastic errors. For this purpose
we consider a Bayesian version of the Kullback- Leibler (KL) optimality
criterion introduced by L’opez-Fidalgo et al. (2007). Discretizing the prior
distribution leads to local KL-optimal discriminating design problems for a
large number of competing models. All currently available methods either
require a large computation time or fail to calculate the optimal
discriminating design, because they can only deal efficiently with a few model
comparisons. In this paper we develop a new algorithm for the determination of
Bayesian optimal discriminating designs with respect to the Kullback-Leibler
criterion. It is demonstrated that the new algorithm is able to calculate the
optimal discriminating designs with reasonable accuracy and computational time
in situations where all currently available procedures are either slow or fail. | | Source: | arXiv, 1508.0279 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER