MétaCan
Menu
Back to cohort
Record W7110836110 · doi:10.1080/10705511.2025.2588572

Evaluating Approaches for the Handling of Sign Reflection in Bayesian Latent Variable Models

2025· article· en· W7110836110 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueStructural Equation Modeling A Multidisciplinary Journal · 2025
Typearticle
Languageen
FieldComputer Science
TopicTopic Modeling
Canadian institutionsMcGill University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsReflection (computer programming)Latent variableBayesian probabilityVariable (mathematics)Sign (mathematics)Pattern recognition (psychology)

Abstract

fetched live from OpenAlex

In Markov chain Monte Carlo estimation of Bayesian latent variable models, sign reflection can cause multiple chains to settle onto equivalent but numerically different solutions, resulting in poorly mixed chains and nonconvergence. Sign reflection can be handled using various methods, such as adopting unit loading identification (ULI), assigning range restricted prior distributions, or using a relabeling algorithm. Some statistical software automatically handles sign reflection in the background, e.g., the blavaan package in R. We conducted simulations to address the lack of comprehensive studies on such a wide variety of approaches. Our results show that most solutions will work well in confirmatory factor analysis given sufficient sample sizes and good measurement models. However, low scale reliability and poor choice of reference indicator can negatively impact the performance, especially with small sample sizes. In particular, we do not recommend using ULI without additional sign reflection handling for Bayesian latent variable models.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.507
Threshold uncertainty score0.579

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.205
GPT teacher head0.375
Teacher spread0.169 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it