MétaCan
Menu
Back to cohort
Record W1842266140 · doi:10.1002/jae.2354

A MOMENT‐MATCHING METHOD FOR APPROXIMATING VECTOR AUTOREGRESSIVE PROCESSES BY FINITE‐STATE MARKOV CHAINS

2013· article· en· W1842266140 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.

Bibliographic record

VenueJournal of Applied Econometrics · 2013
Typearticle
Languageen
FieldMathematics
TopicStatistical Methods and Inference
Canadian institutionsConcordia University
Fundersnot available
KeywordsMarkov chainAutoregressive modelMoment (physics)Applied mathematicsFinite stateMatching (statistics)State spaceMathematicsRange (aeronautics)Markov propertyVariable-order Markov modelMarkov processMarkov kernelMultivariate statisticsState vectorMathematical optimizationMarkov modelComputer scienceEconometricsStatistics

Abstract

fetched live from OpenAlex

SUMMARY This paper proposes a moment‐matching method for approximating vector autoregressions by finite‐state Markov chains. The Markov chain is constructed by targeting the conditional moments of the underlying continuous process. The proposed method is more robust to the number of discrete values and tends to outperform the existing methods for approximating multivariate processes over a wide range of the parameter space, especially for highly persistent vector autoregressions with roots near the unit circle. Copyright © 2013 John Wiley & Sons, Ltd.

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.002
metaresearch head score (Gemma)0.006
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: Methods · Consensus signal: Methods
Teacher disagreement score0.744
Threshold uncertainty score0.799

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
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.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.060
GPT teacher head0.336
Teacher spread0.276 · 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