Linear bootstrap methods for vector autoregressive moving-average models
Bibliographic record
Abstract
We provide the theoretical justification of bootstrapping stationary invertible echelon vector autoregressive moving-average (VARMA) models using linear methods. The asymptotic validity of the bootstrap is established with strong white noise under parametric and nonparametric assumptions. Our methods are practical and useful for building reliable simulation-based inference and forecasting without implementing nonlinear estimation techniques such as ML which is usually burdensome, time demanding or impractical, particularly in big or highly persistent systems. The relevance of our procedures is more pronounced in the context of dynamic simulation-based techniques such as maximized Monte Carlo (MMC) tests [see Dufour J-M. Monte Carlo tests with nuisance parameters: a general approach to finite-sample inference and nonstandard asymptotics in econometrics. J Econom. 2006;133(2):443–477 and Dufour J-M, Jouini T. Finite-sample simulation-based tests in VAR models with applications to Granger causality testing. J Econom. 2006;135(1–2):229–254 for the VAR case]. Simulation evidence shows that, compared with conventional asymptotics, our bootstrap methods have good finite-sample properties in approximating the actual distribution of the studentized echelon VARMA parameter estimates, and in providing echelon parameter confidence sets with satisfactory coverage.
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.005 | 0.027 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.008 | 0.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.
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".