Search arXiv⌕ Search

arXiv · 2611.09676

Local Inference for High-dimensional Time Series

Abstract

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 $(ε_n,δ)$-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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Julien Bodelet, Davide La Vecchia, Johannes Lederer, Oliver Y. Chén. 2026-11-06. Local Inference for High-dimensional Time Series. https://arxiv.org/abs/2611.09676

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Optimal Forecast Reconciliation with Uncertainty Quantification

We propose to estimate the weight matrix used for forecast reconciliation as parameters in a general linear model in order to quantify its uncertainty. This implies that forecast reconciliation can be formulated as an orthogonal projection from the space of base-forecast errors into a coherent linear subspace. We use variance decomposition together with the Wishart distribution to derive the central estimator for the forecast-error covariance matrix. In addition, we prove that distance-reducing properties apply to the reconciled forecasts at all levels of the hierarchy as well as to the forecast-error covariance. A covariance matrix for the reconciliation weight matrix is derived, which leads to improved estimates of the forecast-error covariance matrix. We show how shrinkage can be introduced in the formulated model by imposing specific priors on the weight matrix and the forecast-error covariance matrix. The method is illustrated in a simulation study that shows consistent improvements in the log-score. Finally, standard errors for the weight matrix and the variance-separation formula are illustrated using a case study of forecasting electricity load in Sweden.

stat.ME↗

postcard: An R Package for Marginal Effect Estimation with or without Prognostic Score Adjustment

Covariate adjustment is a widely used technique in randomized clinical trials (RCTs) for improving the efficiency of treatment effect estimators. By adjusting for predictive baseline covariates, variance can be reduced, enhancing statistical precision and study power. Rosenblum and van der Laan [2010] use the framework of generalized linear models (GLMs) in a plug-in analysis to show efficiency gains using covariate adjustment for marginal effect estimation. Recently the use of prognostic scores as adjustment covariates has gained popularity. Schuler et al. [2022] introduce and validate the method for continuous endpoints using linear models. Building on this work Højbjerre-Frandsen et al. [2025] extends the method proposed by Schuler et al. [2022] to be used in combination with the GLM plug-in procedure [Rosenblum and van der Laan, 2010]. This method achieves semi-parametric efficiency under assumptions of additive treatment effects on the link scale. Additionally, Højbjerre-Frandsen et al. [2025] provide a formula for power approximation which is valid even under model misspecification, enabling realistic sample size estimation. This article introduces an R package, which implements the GLM plug-in method with or without PrOgnoSTic CovARiate aDjustment, postcard. The package has two core features: (1) estimating marginal effects and the variance hereof (with or without prognostic adjustment) and (2) approximating statistical power. Functionalities also include integration of the Discrete Super Learner for constructing prognostic scores and simulation capabilities for exploring the methods in practice. Through examples and simulations, we demonstrate postcard as a practical toolkit for statisticians.

stat.ME↗

Multi-layer dissolution exponential-family models for weighted signed networks

Understanding the structure of signed weighted networks is essential for analysing complex systems in which relationships between nodes vary both in sign and strength. Despite significant advances in statistical network analysis, there is still a lack of models that can account for both the sign and the strength of interactions in networks. We introduce a multi-layer dissolution exponential random graph modelling framework that enables systematic assessment of structural balance effects. We adopt a fully-probabilistic hierarchical approach that partially pools information across layers, with parameters estimated via an adaptive approximate exchange algorithm. A simulation study shows that the algorithm recovers the layer-specific parameters with small bias. We demonstrate the flexibility and explanatory power of the proposed methodology through an application to the gene interaction network associated with dilated cardiomyopathy, in which a multi-layer signed structure is constructed by progressively thresholding interaction confidence scores, with edge signs derived from pairwise co-expression. The analysis shows that positive co-expression edges embedded in positive triangles are more likely to persist at higher confidence levels, while negative edges whose endpoints share positive partners, which form unbalanced triangles, are preferentially dissolved as the confidence threshold increases.

stat.ME↗