MétaCan
Menu
Back to cohort
Record W3153250534

Bayesian Computations via MCMC, with applications to Big Data and Spatial Data

2018· dissertation· en· W3153250534 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.

aboutThe title or abstract carries a Canadian signal from the geographic lexicon.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueTSpace (University of Toronto) · 2018
Typedissertation
Languageen
FieldComputer Science
TopicBayesian Methods and Mixture Models
Canadian institutionsnot available
Fundersnot available
KeywordsMarkov chain Monte CarloApproximate Bayesian computationBig dataBayesian probabilityComputationComputer scienceSpatial analysisData scienceData miningStatisticsArtificial intelligenceMathematicsAlgorithm
DOInot available

Abstract

fetched live from OpenAlex

Markov Chain Monte Carlo (MCMC) methods are fundamental tools for sampling highly complex distributions. They are crucial to Bayesian inference as posterior distributions are generally analytically intractable. In this thesis, we tackle two Bayesian inference problems via MCMC methods, that will lie on both methodology and application aspects.\nThe first part of this thesis tackles the computational challenges of Bayesian inference from big data. We develop a new communication-free parallel method, the "Likelihood Inflating Sampling Algorithm (LISA)", that significantly reduces computational costs by randomly splitting the dataset into smaller subsets and running MCMC methods independently in parallel on each subset using different processors. Each processor will be used to run an MCMC chain that samples sub-posterior distributions which are defined using an "inflated" likelihood function. We then discuss on the approaches to combine all sub-samples from all processors to build a highly accurate posterior distribution that is consistent with the full posterior distribution. More importantly, we learn a strategy in combining LISA's draws to study the full posterior of the more complex Bayesian Additive Regression Trees (BART) model, which is highly important in non-parametric regression. We also successfully examine the consistency in performance of LISA on BART with new efficient Metropolis-Hastings proposals introduced by Pratola (2016).\nThe second part of this thesis is focused on the applied aspect of performing Bayesian inference with MCMC methods. We study a Bayesian Geostatistical model to analyze spatial data from the Timiskaming Abitibi River forests in Ontario Canada, provided by the First Resource Management Group Inc.. We implement an MCMC algorithm to perform Bayesian inference on predicting the proportion of hardwood trees from elevation and vegetation index. Spatial predictions are made for new sites in the forests and results are compared with a Logistic Regression model without a spatial effect. We study the trend of accuracy in predictions when fitting fewer data to the model, and present useful insights on the trade-off between performance and the costly need for collecting ground truth data. We further discuss a stratified sampling approach in choosing the subsets of data that allows for potential better predictions.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.987
Threshold uncertainty score1.000

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.0030.001
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.295
Teacher spread0.258 · 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