MétaCan
Menu
Back to cohort
Record W2228510385

On Marginal Likelihood Computation in Change-Point Models

2009· article· en· W2228510385 on OpenAlexaff
Luc Bauwens, Jeroen V.K. Rombouts

Bibliographic record

VenueCahiers de recherche · 2009
Typearticle
Languageen
FieldDecision Sciences
TopicEfficiency Analysis Using DEA
Canadian institutionsHEC Montréal
Fundersnot available
KeywordsMarginal likelihoodApproximate Bayesian computationLikelihood functionBayesian inferenceInferenceBayesian probabilityRestricted maximum likelihoodMathematicsComputationModel selectionBayesian information criterionStatisticsMarginal structural modelEconometricsComputer scienceEstimation theoryAlgorithmArtificial intelligenceCausal inference
DOInot available

Abstract

fetched live from OpenAlex

Change-point models are useful for modeling time series subject to structural breaks. For interpretation and forecasting, it is essential to estimate correctly the number of change points in this class of models. In Bayesian inference, the number of change points is typically chosen by the marginal likelihood criterion, computed by Chib’s method. This method requires one to select a value in the parameter space at which the computation is performed. Bayesian inference for a change-point dynamic regression model and the computation of its marginal likelihood are explained. Motivated by results from three empirical illustrations, a simulation study shows that Chib’s method is robust with respect to the choice of the parameter value used in the computations, among posterior mean, mode and quartiles. However, taking into account the precision of the marginal likelihood estimator, the overall recommendation is to use the posterior mode or median. Furthermore, the performance of the Bayesian information criterion, which is based on maximum likelihood estimates, in selecting the correct model is comparable to that of the marginal likelihood.

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.015
metaresearch head score (Gemma)0.100
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.015
Threshold uncertainty score0.077

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0150.100
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0030.002
Bibliometrics0.0040.004
Science and technology studies0.0010.003
Scholarly communication0.0030.004
Open science0.0030.004
Research integrity0.0010.004
Insufficient payload (model declined to judge)0.0070.002

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.392
GPT teacher head0.463
Teacher spread0.070 · 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

Citations0
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueCahiers de rechercheSame topicEfficiency Analysis Using DEAFrench-language works237,207