Metraipolis › archive › dc_cf9ecfb260d0

Local Inference for High-dimensional Time Series — arXiv:2611.09676

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.09676
License (as archived)
CC0-1.0
Archived
2026-11-09T22:42:20.952Z
SHA-256 of the archived text
ad1e31fb0b4ab747512fcf302471c86bb7f2b0a27e3bd8e1536ad1b7a2d27614
Stable URL of this page
https://metraipolis.com/documento/dc_cf9ecfb260d0

How to cite

Local Inference for High-dimensional Time Series — arXiv:2611.09676 — arXiv (en), https://arxiv.org/abs/2611.09676 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cf9ecfb260d0 (Metraipolis archive dc_cf9ecfb260d0, sha256 ad1e31fb0b4ab747512fcf302471c86bb7f2b0a27e3bd8e1536ad1b7a2d27614)
BibTeX
@misc{dccf9ecfb260d0,
  title = {Local Inference for High-dimensional Time Series — arXiv:2611.09676},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.09676},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cf9ecfb260d0; sha256 ad1e31fb0b4ab747512fcf302471c86bb7f2b0a27e3bd8e1536ad1b7a2d27614},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09676. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Local stationarity provides a natural framework for time series whose dependence structure evolves smoothly over time. In high-dimensional settings, however, its classical definition can break down, as approximation errors accumulate across time-varying coefficients. To address this limitation, we introduce $(\epsilon_n,\delta)$-stationarity, a generalization of local stationarity that holds locally in time and allows approximation errors to grow with the dimension, and we combine it with local sparsity, which lets the set of relevant predictors change over time. We show that, for high-dimensional time-varying autoregressions, the rate of stationary approximation is driven by local sparsity, so that local sparsity governs not only estimation but also the stationary approximation itself. We then develop a \textit{local lasso} with time-varying penalties that selects relevant predictors and their periods of activity, and we derive error bounds that depend on the local sparsity, quantify the cost of nonstationarity, and guide penalty and bandwidth selection. For inference, we propose a desparsified local lasso based on local nodewise regressions and establish a linear representation with an explicit smoothing bias. Asymptotic normality then follows under two bandwidth conditions, one for coefficient variation and one for nonstationarity. Simulations and applications to macroeconomic and neuroscience data illustrate the methods.

Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ME, nuovi lavori del giorno).
Categorie arXiv: Methodology (stat.ME).
Pagina del lavoro: https://arxiv.org/abs/2611.09676 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:34:47.271Z dalla pagina https://arxiv.org/list/stat.ME/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).