MétaCan
Menu
Back to cohort
Record W2962950510 · doi:10.48550/arxiv.1206.4654

A Generalized Loop Correction Method for Approximate Inference in\n Graphical Models

2012· preprint· en· W2962950510 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.

Bibliographic record

VenuearXiv (Cornell University) · 2012
Typepreprint
Languageen
FieldComputer Science
TopicBayesian Modeling and Causal Inference
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsGraphical modelBelief propagationInferenceDependency (UML)Approximate inferenceLoop (graph theory)Computer scienceProbabilistic logicAlgorithmTree (set theory)Theoretical computer scienceMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

Belief Propagation (BP) is one of the most popular methods for inference in\nprobabilistic graphical models. BP is guaranteed to return the correct answer\nfor tree structures, but can be incorrect or non-convergent for loopy graphical\nmodels. Recently, several new approximate inference algorithms based on cavity\ndistribution have been proposed. These methods can account for the effect of\nloops by incorporating the dependency between BP messages. Alternatively,\nregion-based approximations (that lead to methods such as Generalized Belief\nPropagation) improve upon BP by considering interactions within small clusters\nof variables, thus taking small loops within these clusters into account. This\npaper introduces an approach, Generalized Loop Correction (GLC), that benefits\nfrom both of these types of loop correction. We show how GLC relates to these\ntwo families of inference methods, then provide empirical evidence that GLC\nworks effectively in general, and can be significantly more accurate than both\ncorrection schemes.\n

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.866
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.001
Research integrity0.0010.001
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.143
GPT teacher head0.255
Teacher spread0.112 · 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