On the partial autocorrelation function for locally stationary time series: characterization, estimation and inference
Bibliographic record
Abstract
SUMMARY For stationary time series, it is common to use plots of the partial autocorrelation function (PACF) or PACF-based tests to explore the temporal dependence structure of the process. To the best of our knowledge, analogues for nonstationary time series have not yet been fully developed. This article aims to fill this gap for locally stationary time series with short-range dependence. First, we characterize the PACF locally in the time domain and show that the jth PACF decays with j at a rate that adapts to the temporal dependence of the time series $ \{x_{i,n}\} $. Second, at each time $ i, $ inspired by Killick et al. (2020). We show that the PACF can be efficiently approximated by the best linear prediction coefficients via the Yule–Walker equations. This allows us to study the PACF via ordinary least squares locally. Third, we show that the PACF is smooth in time for locally stationary time series. We use the sieve method with ordinary least squares to estimate the PACF and construct some statistics to test the PACF and infer the structure of the time series. These tests generalize and modify those used in Brockwell & Davis (1987) for stationary time series. Finally, a multiplier bootstrap algorithm is proposed for practical implementation and an R package Sie2nts is provided to implement the algorithm. Numerical simulations and real-data analysis confirm the usefulness of our results.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".