Identification and Estimation in Non-Fundamental Structural VARMA Models
Bibliographic record
Abstract
Abstract The basic assumption of a structural vector autoregressive moving average (SVARMA) model is that it is driven by a white noise whose components are uncorrelated or independent and can be interpreted as economic shocks, called “structural” shocks. When the errors are Gaussian, independence is equivalent to non-correlation and these models face two identification issues. The first identification problem is “static” and is due to the fact that there is an infinite number of linear transformations of a given random vector making its components uncorrelated. The second identification problem is “dynamic” and is a consequence of the fact that, even if a SVARMA admits a non-invertible moving average (MA) matrix polynomial, it may feature the same second-order dynamic properties as a VARMA process in which the MA matrix polynomials are invertible (the fundamental representation). The aim of this article is to explain that these difficulties are mainly due to the Gaussian assumption, and that both identification challenges are solved in a non-Gaussian framework if the structural shocks are assumed to be instantaneously and serially independent. We develop new parametric and semi-parametric estimation methods that accommodate non-fundamentalness in the MA dynamics. The functioning and performances of these methods are illustrated by applications conducted on both simulated and real data.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.006 | 0.018 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".