MétaCan
Menu
Back to cohort
Record W3004464990 · doi:10.3982/te3273

Locally Bayesian learning in networks

2020· article· en· W3004464990 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

VenueTheoretical Economics · 2020
Typearticle
Languageen
FieldPhysics and Astronomy
TopicOpinion Dynamics and Social Influence
Canadian institutionsUniversity of British Columbia
FundersSocial Sciences and Humanities Research Council of Canada
KeywordsComputer scienceBayesian networkArtificial intelligenceTree (set theory)Variable-order Bayesian networkMachine learningBayesian probabilityBayesian inferenceMathematics

Abstract

fetched live from OpenAlex

Agents in a network want to learn the true state of the world from their own signals and their neighbors' reports. Agents know only their local networks, consisting of their neighbors and the links among them. Every agent is Bayesian with the (possibly misspecified) prior belief that her local network is the entire network. We present a tractable learning rule to implement such locally Bayesian learning : each agent extracts new information using the full history of observed reports in her local network. Despite their limited network knowledge, agents learn correctly when the network is a social quilt , a tree‐like union of cliques. But they fail to learn when a network contains interlinked circles (echo chambers), despite an arbitrarily large number of correct signals.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.762
Threshold uncertainty score0.922

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.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.005
GPT teacher head0.214
Teacher spread0.209 · 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