MétaCan
Menu
Back to cohort
Record W6999162939

Characterizing Qualitative Causal Dependency for NAT-modeled Bayesian Networks

2023· dissertation· en· W6999162939 on OpenAlexafffund

Bibliographic record

VenueThe Atrium (University of Guelph) · 2023
Typedissertation
Languageen
FieldComputer Science
TopicBayesian Modeling and Causal Inference
Canadian institutionsUniversity of Guelph
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDependency (UML)Bayesian networkBayesian probabilityNatFocus (optics)Conditional probabilitySubspace topologyDependency theory (database theory)Tree (set theory)Conditional dependence
DOInot available

Abstract

fetched live from OpenAlex

The Non-impeding noisy-AND Tree (NAT) model is a local model we focus on in Bayesian networks (BNs). In order to improve algorithms for learning structures of NAT-modeled BNs, further understanding of dependency between a cause and the effect within a NAT model is required. For example, how does the dependence vary with the location of a causal event and values of single-causals? Although dependence between them can be measured by mutual information computed using algorithms for NAT conditional probability distributions (CPDs), it does not address directly what conditions of NAT models render the dependence stronger or weaker at the macro level.
\n
\nA computational framework is developed in this research for analyzing qualitative dependency in the NAT-modeled BNs. The framework involves reducing the exponential space of NAT structures to a tractable subspace through chain NATs, converting NATs to equivalent chain NATs exactly and qualitatively, and conducting a qualitative dependency analysis for chain NATs by the approach with imprecise probabilities. Our experiment demonstrates the feasibility of qualitative estimation of dependency through this framework. The qualitative analysis helps identify the most influential aspects of causal dependency in the NAT 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.

How this classification was reachedexpand

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.950
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.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0020.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.037
GPT teacher head0.287
Teacher spread0.250 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2023
Admission routes2
Has abstractyes

Explore more

Same venueThe Atrium (University of Guelph)Same topicBayesian Modeling and Causal InferenceFrench-language works237,207