Search arXiv⌕ Search

arXiv · 2610.08443

Scalable Regularized Vector Multiplicative Error Models for Positive-valued Financial Time Series

Abstract

The logarithmic multiplicative error model (log-vMEM) has been useful in modeling and forecasting multivariate positive-valued financial time series. The number of parameters grow rapidly with the dimension of the system and the lag order, making estimation computationally demanding in high-dimensional settings. This paper describes regularized estimation via hierarchical lag structures (Nicholson et al., 2020) for log-vMEM models with multivariate gamma error distribution of Tsionas (2004). The parameter estimation is performed using a blockwise coordinate descent algorithm with a Gauss-Seidel-style update scheme (Wright, 2015). This enables an efficient computation strategy compared to traditional penalized maximum likelihood approaches. The competing models are juxtaposed against each other by combining three hierarchical lag structures (componentwise, elementwise, own-other) and four penalties(group-lasso, adaptive group-lasso, group-mcp, and group-scad). Extensive simulation runs have been performed to test the parameter recovery for both the unpenalized and the penalized models. We apply the proposed methods to model the joint dynamics of robust intraday realized volatility measures for Microsoft (NASDAQ: MSFT) for the competing models. The numerical integration step of the log-likelihood is identified to be the principal computational bottleneck. We address this issue by using GPU-accelerated quadrature integration thus improving computational scalability of the proposed models.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rohan Hemant Chhatre, Chiranjit Dutta, Nalini Ravishanker, Sumanta Basu. 2026-10-06. Scalable Regularized Vector Multiplicative Error Models for Positive-valued Financial Time Series. https://arxiv.org/abs/2610.08443

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

KEEP EXPLORING

Related papers

NExt-LMM: a two-stage LMM framework with near-exact variance components for genome-wide association studies

Linear mixed models (LMMs) are widely used in genome-wide association studies (GWAS) to account for population stratification and cryptic relatedness. However, their practical application remains computationally challenging because parameter estimation and association testing require large-scale operations on genetic similarity matrices (GSMs). Here, we present NExt-LMM, a two-stage framework for scalable LMM-based GWAS. In the first stage, NExt-LMM obtains a preliminary estimate of a shared variance ratio under the null model. In the second stage, it constructs the corresponding covariance matrix and accelerates downstream inference through a Hierarchical Off-Diagonal Low-Rank (HODLR) representation. Specifically, NExt-LMM exploits the low-rank structure of off-diagonal covariance blocks to enable substantially faster matrix factorization and inverse-related computations than conventional dense decompositions. It then reuses the resulting HODLR-based covariance representation to accelerate maximum-likelihood-based inference under the shared variance-ratio setting. We further establish error bounds that account for both sources of approximation in the framework: the preliminary variance-ratio estimate and the HODLR approximation. In particular, we show that, conditional on a fixed variance ratio, the NExt-LMM estimator can be made arbitrarily close to the exact shared-variance estimator as the matrix approximation tolerance approaches zero. \AAA{Numerical experiments show that NExt-LMM improves computational efficiency while maintaining high accuracy relative to existing methods, and that the size of this improvement is governed by the numerical rank retained at the tolerance required for calibrated association inference.} We provide an open-source Python implementation at https://github.com/ZhibinPU/NExt-LMM.

stat.CO↗

On the Convergence of Wasserstein Gradient Descent for Sampling

This paper studies the optimization of the KL functional on the Wasserstein space of probability measures, and develops a sampling framework based on Wasserstein gradient descent (WGD). We identify two important subclasses of the Wasserstein space for which the WGD scheme is guaranteed to converge, thereby providing new theoretical foundations for optimization-based sampling methods on measure spaces. For practical implementation, we construct a particle-based WGD algorithm in which the score function is estimated via score matching. Through a series of numerical experiments, we demonstrate that WGD can provide good approximation to a variety of complex target distributions, including those that pose substantial challenges for standard MCMC and parametric variational Bayes methods. These results suggest that WGD offers a promising and flexible alternative for scalable Bayesian inference in high-dimensional or multimodal settings.

stat.CO↗

postshock: An R Package for Donor-Adjusted Forecasting After Structural Shocks

We present the postshock R package, which implements and extends a donor-based framework for forecasting when a structural shock is known and the target response of interest is not yet observed. The package estimates shock effects from historical donor episodes, balances donors using specified matching features, and transfers the resulting adjustment to a target-series forecast. It provides integrated workflows for conditional mean forecasting through ARIMA and ARIMAX models and conditional variance forecasting through GARCH-X models. Additional functionality includes structured donor pools, control-shock regressors, automated GARCH-X order selection, processed data objects, and reproducible empirical workflows.

stat.CO↗