Search arXiv⌕ Search

arXiv · 2610.19921

Improved Forecasting for Multivariate Time Series using GNAR models with General Inverse Distance Weights

Abstract

Many multivariate time series arise on networks where relationships between variables depend on physical or more general distances. Standard vector autoregressive models struggle in such settings due to their quadratic parameter growth, while generalised network autoregressive (GNAR) models offer a parsimonious alternative by explicitly incorporating network structures. Existing GNAR formulations assume fixed weights, typically uniform or reciprocal distances, which may not reflect the true influence of distance in real systems. We introduce a novel model with general inverse distance weights (GNARID) that extends GNAR by introducing a tunable exponent parameter that controls the strength of distance penalisation. We establish theoretical results on the consistency and asymptotic normality of new GNARID estimators, including an extension to the setting where the number of nodes grows. We analyse the effect of misspecifying the exponent on forecasting error, which helps assess how much GNAR models could be improved by our tunable weights. Simulation studies confirm the theoretical properties and show measurable benefits from correct weight specification. Using the Brumadinho ground displacement dataset, we show that proper tuning of the weight exponent improves predictive performance, highlighting the practical value of flexible distance-based weighting in network time series models.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hengxu Liu, Guy P. Nason, Sourav Das, Stephen Grebby. 2026-10-14. Improved Forecasting for Multivariate Time Series using GNAR models with General Inverse Distance Weights. https://arxiv.org/abs/2610.19921

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

KEEP EXPLORING

Related papers

Asymmetric Space-Time Covariance Functions via Hierarchical Mixtures

This work is focused on constructing space-time covariance functions through a hierarchical mixture approach that can serve as building blocks for capturing complex dependency structures. This approach provides a unifying modeling framework that not only constructs a new class of asymmetric space-time covariance functions with closed-form expressions, but also provides corresponding space-time process representations, which further unify constructions for several existing space-time covariance models. This hierarchical mixture framework decomposes the complexity of model specification at different levels of hierarchy, for which parsimonious covariance models can be specified with simple mixing measures to yield flexible properties and closed forms. A characterization theorem is provided to study how the mixing measures determine the statistical properties of covariance functions. Several new covariance models resulting from this framework are discussed in terms of their practical usefulness. This hierarchical mixture approach is extended for nonstationary and multivariate settings. A theorem is also provided to construct valid asymmetric space-time covariance functions with arbitrary and possibly different degrees of smoothness and long-range dependence in space and in time. This generalized class also bridges a theoretical gap in using the Lagrangian reference framework. The superior performance of several new parsimonious covariance models over existing models is verified with the well-known Irish wind data and the U.S. air temperature data.

stat.ME↗

A Latent-Space Statistical Learning Framework for Semicontinuous Outcomes: Regularized Deviance and Boundary-Stabilized Optimization

Semicontinuous outcomes characterized by an exact zero mass and heavy-tailed continuous distributions challenge empirical risk modeling and machine learning. Compound Poisson-Gamma Tweedie processes impose a rigid mean-variance coupling that distorts zero-mass probabilities under extreme tail dispersion, flattening continuous density and reducing extreme-risk discrimination. Furthermore, heuristic post-hoc target capping introduces systematic bias while leaving loss gradients vulnerable to tail leverage. We present a unified, statistically coherent likelihood framework for semicontinuous modeling under arbitrary zero-inflation and explicit upper boundary constraints. Optimization and likelihood evaluations operate strictly in a latent space defined by the power-scaling mapping $y_i^* = \min\{(y_i/s)^λ, U^*\}$, where $s \in (0, U)$ anchors scale and $λ\in (0,1)$ regularizes tail curvature. The architecture partitions the response into three regimes: an unconstrained Bernoulli hurdle, an analytical continuous Gamma body, and an upper boundary point mass governed by incomplete Gamma survival ratios. Rather than an arbitrary truncation, the boundary functions as an intrinsic tail accumulator bounding score and Hessian dynamics. We derive the closed-form deviance objective, score vectors, and block-diagonal Hessian matrix, proving that parameter spaces are information-orthogonal to enable concurrent classification and regression updates. Asymptotic boundary analysis demonstrates that score and curvature scale linearly in the deep tail, establishing a quadratic restoring force that prevents gradient collapse. The framework breaks the Tweedie parameter rigidity paradox while maintaining structural fidelity across both zero occurrence and extreme severity differentiation.

stat.ME↗