High performance Gibbs sampling for IRT models using row-wise decomposition (Q355520)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6191053
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | High performance Gibbs sampling for IRT models using row-wise decomposition |
scientific article; zbMATH DE number 6191053 |
Statements
High performance Gibbs sampling for IRT models using row-wise decomposition (English)
0 references
25 July 2013
0 references
Summary: Item response theory (IRT) is a popular approach used for addressing statistical problems in psychometrics as well as in other fields. The fully Bayesian approach for estimating IRT models is computationally expensive. This limits the use of the procedure in real applications. In an effort to reduce the execution time, a previous study shows that high performance computing provides a solution by achieving a considerable speedup via the use of multiple processors. Given the high data dependencies in a single Markov chain for IRT models, it is not possible to avoid communication overhead among processors. This study is to reduce communication overhead via the use of a row-wise decomposition scheme. The results suggest that the proposed approach increased the speedup and the efficiency for each implementation while minimizing the cost and the total overhead. This further sheds light on developing high performance Gibbs samplers for more complicated IRT models.
0 references
0 references
0.8643609285354614
0 references
0.772521436214447
0 references
0.7476717829704285
0 references
0.7409066557884216
0 references
0.7401005029678345
0 references