MétaCan
Menu
Back to cohort
Record W2792333427 · doi:10.5539/ijsp.v7n3p1

On Estimating Non-standard Discrete Distributions Using Adaptive MCMC Methods

2018· article· en· W2792333427 on OpenAlexvenueno aff
Hatem Baffoun, Mekki Hajlaoui, Abdeljelil Farhat

Bibliographic record

VenueInternational Journal of Statistics and Probability · 2018
Typearticle
Languageen
FieldMathematics
TopicMarkov Chains and Monte Carlo Methods
Canadian institutionsnot available
Fundersnot available
KeywordsEstimatorMetropolis–Hastings algorithmContext (archaeology)Markov chain Monte CarloBayesian probabilityAlgorithmComputer scienceMathematicsMathematical optimizationStatistics

Abstract

fetched live from OpenAlex

In this paper, we compare empirically the performance of some adaptive MCMC methods, that is, Adaptive Metropolis (AM) algorithm, Single Component Adaptive Metropolis (SCAM) algorithm and Delayed Rejection Adaptive Metropolis (DRAM) algorithm. The context is the simulation of non-standard discrete distributions. The performance criterion used is the precision of the frequency estimator. An application to a Bayesian hypothesis testing problem shows the superiority of the DRAM algorithm over the other considered sampling schemes.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.019
metaresearch head score (Gemma)0.104
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.019
Threshold uncertainty score0.099

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0190.104
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.002
Scholarly communication0.0010.003
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0020.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.086
GPT teacher head0.448
Teacher spread0.362 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations1
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueInternational Journal of Statistics and ProbabilitySame topicMarkov Chains and Monte Carlo MethodsFrench-language works237,207