This work proposes a regularized additive tensor autoregressive model with additive interaction of row-wise, column-wise and tube-wise temporal dependence that offers more interpretability, less computational burden due to its convex nature and estimation of the underlying low rank plus sparse pattern of its transition matrices.
Abstract
High-dimensional time series has diverse applications in econometrics and finance. Recent models for capturing temporal dependence have employed a bilinear representation for matrix time series, or the Tucker-decomposition based representation in case of tensor time series. A Tucker-decomposition based temporal effect is difficult to interpret on many occasions, along with its computational complexity due to the non-convex nature of the underlying optimization problem. Moreover, the existing tensor models have not sufficiently explored the possibilities of imposing any lower-dimensional pattern on the transition matrices. In this work, we propose a regularized additive tensor autoregressive model with additive interaction of row-wise, column-wise and tube-wise temporal dependence, that offers more interpretability, less computational burden due to its convex nature and estimation of the underlying low rank plus sparse pattern of its transition matrices. We address the issue of identifiability of the various components in our model and subsequently develop a scalable alternating block minimization algorithm for estimating the parameters. We provide a finite sample error bound under high-dimensional scaling for the model parameters. Finally, the efficacy of the proposed model is demonstrated on synthetic and real data.
We propose a Riemannian factor model (RFM), a novel framework for analyzing potentially high-dimensional time series data observed on Riemannian manifolds. Such time series are encountered in various applications, including economics, finance, medical imaging, and genomics and microbiome research. The proposed model is geometry-aware and accounts for the inherent nonlinearity in the data. In a high-dimensional asymptotic regime, where the manifold dimension is allowed to diverge with the sample size $n$, we establish convergence rates for the estimated loading space. In particular, under short-memory and strong factor conditions, we obtain a dimension-free $n^{-1/2}$ rate, which matches the convergence rate of the high-dimensional linear factor model. Finite-sample performance of the proposed RFM is demonstrated with simulated time series on the Bures--Wasserstein manifolds and products of spheres, as well as an application to monthly realized covariances of selected U.S. stock returns---modeled as time series in the Bures--Wasserstein manifold, where the RFM provides demonstrably interpretable factors and yields competitive predictive performance.
Shuo-chieh Huang, Rong Chen, Ya-Qing Chen· 0 citations
Integer-valued time series are ubiquitous in fields such as finance, economics, and epidemiology. As spatiotemporal data structures in these domains grow increasingly complex and high-dimensional, the matrix integer-valued autoregressive (MINAR) model efficiently captures row-column cross-correlations to reduce dimensionality. However, it fundamentally fails to accommodate negative values, which is a critical flaw for analyzing real-world differenced data or financial tick fluctuations. To bridge this theoretical and practical gap, this paper introduces the Z-MINAR model, a novel matrix autoregressive framework defined on the full integer domain (Z). By pioneering a signed matrix thinning operator and utilizing an extended poisson distribution for the innovations, the Z-MINAR model elegantly handles both positive and negative integers while strictly preserving the crucial topological interactions inherent in matrix data. Furthermore, we employ a projection-based conditional least squares estimation procedure and rigorously establish the model's stationarity, causality, and asymptotic normality. Extensive simulations demonstrate the superior estimation accuracy, robustness, and adaptability of Z-MINAR over existing benchmark models. Finally, an empirical application focusing on crime count variations across different urban regions confirms the model's practical efficacy in uncovering dynamic spatiotemporal dependence structures in Z-valued matrix time series.
Laplace factor models (LFMs) provide a heavy-tailed alternative to Gaussian factor models by representing high-dimensional observations through a low-rank common component and Laplace-distributed idiosyncratic errors. This paper develops an assumption-consistent finite-sample analysis of matrix concentration, covariance estimation, and Monte Carlo integration under this model. We first formulate the model with explicit dimensional, independence, covariance, and identifiability conditions. Standard matrix Laplace-transform and matrix Bernstein inequalities are then recalled with their precise applicability conditions. Because untruncated Laplace variables are neither almost surely bounded nor strongly log-concave, these standard results cannot be applied directly in the forms commonly used for bounded or Gaussian-like observations. To address this issue, we analyze a coordinatewise truncated covariance estimator and derive an operator-norm bound that separates the stochastic estimation error from the truncation bias. The resulting rate depends on the effective rank and the logarithm of the ambient dimension and is therefore not dimension-free. For Monte Carlo integration, we replace strong-log-concavity arguments by a sub-exponential concentration analysis that is compatible with independent Laplace errors and yields non-asymptotic absolute- and relative-error bounds. Simulation studies compare empirical tails with the classical matrix Bernstein bound, evaluate ordinary, truncated, winsorized, PCA, POET-type, and Huberized covariance estimators, and we compare Laplace-based and Studentized confidence intervals. The results show that the classical Bernstein bound can be conservative, and truncation involves a substantial bias–variance trade-off. In a Wine chemical-analysis application, three factors explain 66.53% of the standardized variance, and POET-type covariance estimation attains a cross-validated balanced accuracy of 0.9901. These findings clarify both the scope and the limitations of finite-sample analysis for LFMs.
Siqi Liu, X. Wen, A. Adekpedjou et al.· Mathematics· 0 citations
In this paper, we study the autocovariance matrix estimation and inference problems under heavy-tailedness, high-dimensionality, general nonlinear temporal dependence, and potentially nonstationarity of time series. We consider two types of tail-robust autocovariance matrix estimation methods: the element-wise Huber's $M$-estimator and a computationally more efficient element-wise truncated estimator. Both estimators are designed to achieve sharp error bounds in matrix max-norm. The nonasymptotic properties of these estimators are proved based on new variants of Bernstein-type inequalities under functional dependence for the potentially nonstationary processes which may be of independent interest. Moreover, we prove a high-dimensional Gaussian approximation result, as a limiting distribution, for our element-wise truncated autocovariance estimator. A Gaussian multiplier bootstrap result is also given to facilitate the practicality. Our theoretical results are nonasymptotic, which gives explicit error bounds in terms of the sample size, dimensionality, moments, and the strength of temporal dependence. Numerical evidence is provided to support our theoretical results. Finally, we illustrate the benefits of the proposed methodology for detecting change points in monthly macroeconomic data.
Hao-Tian Xu, S. Guerrier, Run-Ze Li et al.· 0 citations
Vector autoregressive moving-average (VARMA) models have long been considered impractical beyond moderate dimensions: the likelihood is non-convex, the parametrization is identified only up to equivalence, and every evaluation costs a pass over the entire series. Yet their moving-average term captures with a few parameters what a pure autoregression matches only with many lags. We introduce an estimation framework that removes this computational barrier: each optimization iteration is independent of the series length $T$. The framework combines a partial-autocorrelation reparametrization that guarantees stationarity and invertibility by construction, Gaussian priors on the reparametrized coefficients with separate scales for diagonal and off-diagonal entries, and losses that depend on the data only through fixed-size sufficient statistics, evaluated by a Parseval (Fourier) identity at near-linear cost in the truncation length. This yields two point estimators: a regularized least-squares fit and a covariance-marginalized maximum-a-posteriori estimator. We prove that both recover the infinite-autoregressive representation of the true process at a near-parametric rate in fixed dimension, so the truncation introduces no asymptotic bias. The same machinery extends, at the same leading cost, to seasonal dynamics, exogenous regressors (VARMAX), and rolling-window refits. Empirically, the estimators stay close to the oracle forecast error from $d=10$ to $d=40$ (where classical conditional MLE returns non-invertible fits whose forecasts diverge) and match or beat VAR, Bayesian-VAR, component-wise ARMA, and sparse-VARMA baselines on retail-demand, meteorological, and air-quality data. This brings likelihood-based VARMA estimation, at a per-iteration cost independent of the series length, to the problem sizes where practitioners have so far relied on VAR models.
Modeling shared and subject-specific structure in multisubject spatiotemporal data remains challenging, particularly in neuroimaging, where both spatial and temporal patterns exhibit rich variability across subjects. Existing matrix and tensor decompositions provide interpretable factorizations, but rely on fixed multilinear structures or coupling schemes that may limit their flexibility in capturing complex variability. In this work, we introduce a spatiotemporal variational tensor decomposition (ST-VTD) framework that combines a tensor factorization generative model with structured priors to jointly represent spatial maps and temporal dynamics. Spatial factors are regularized to promote a low-rank structure inspired by the LL1 decomposition, while temporal factors are modeled using a learned Long short-term memory (LSTM)-based prior, enabling flexible and adaptive dynamics. Posterior inference is performed using an amortized variational formulation by unrolling iterations of an optimization algorithm, leading to an interpretable and parameter-efficient architecture. The proposed inference framework employs a warm-start strategy based on group independent component analysis, which we found to improve optimization performance. Experiments on a realistic synthetic functional MRI (fMRI) dataset demonstrate that the proposed approach significantly improves latent factor recovery compared with representative classical and probabilistic decomposition benchmarks.
L. Montaldo, R. Borsoi, Sebastian Miron et al.· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
