MétaCan
Menu
Back to cohort
Record W2054903053 · doi:10.1109/icif.2005.1591923

Sequential auxiliary particle belief propagation

2005· article· en· W2054903053 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicBayesian Modeling and Causal Inference
Canadian institutionsUniversity of British Columbia
FundersEngineering and Physical Sciences Research CouncilUniversity of British ColumbiaQinetiQ
KeywordsBelief propagationGraphical modelApproximate inferenceInferenceComputer scienceParticle filterAlgorithmGaussianMonte Carlo methodMathematical optimizationTheoretical computer scienceArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

This paper discloses a novel algorithm for efficient inference in undirected graphical models using sequential Monte Carlo (SMC) based numerical approximation techniques. The methodology developed, titled "auxiliary particle belief propagation", extends the applicability of the much celebrated (Loopy) belief propagation (LBP) algorithm to non-linear, non-Gaussian models, whilst retaining a computational cost that is linear in the number of sample points (or particles). Furthermore, we provide an additional extension to this technique by analyzing temporally evolving graphical models, a problem which remains largely unexplored in the scientific literature. The work presented is thus a general framework that can be applied to a plethora of novel distributed fusion problems. In this paper, we apply our inference algorithm to the (sequential problem of) articulated object tracking.

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.000
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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.928
Threshold uncertainty score0.650

Codex and Gemma teacher scores by category

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

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.029
GPT teacher head0.266
Teacher spread0.237 · 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

Quick stats

Citations63
Published2005
Admission routes2
Has abstractyes

Explore more

Same topicBayesian Modeling and Causal InferenceFrench-language works237,207