High performance Gibbs sampling for IRT models using row-wise decomposition (Q355520): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58690167, #quickstatements; #temporary_batch_1714830594367
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bayesian estimation of item response curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical theory for logistic mental test models with a prior distribution of ability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Item Response Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4272782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains for exploring posterior distributions. (With discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855364 / rank
 
Normal rank

Latest revision as of 15:43, 6 July 2024

scientific article
Language Label Description Also known as
English
High performance Gibbs sampling for IRT models using row-wise decomposition
scientific article

    Statements

    High performance Gibbs sampling for IRT models using row-wise decomposition (English)
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references