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

Rohan Hemant Chhatre; Chiranjit Dutta; Nalini Ravishanker; Sumanta Basu

Home/Archive/arXiv

arXiv · 2610.08443

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

Rohan Hemant Chhatre·Chiranjit Dutta·Nalini Ravishanker·Sumanta Basu

View original source ↗Read source document ↗Export metadata ↓

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

stat.CO stat.AP stat.ML

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

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

arXiv2026

BKP: An R Package for Beta Kernel Process Modeling

Estimating input-dependent probability surfaces from binary, binomial, categorical, or multinomial response data is a common task in statistics and machine learning. Latent Gaussian process classifiers provide flexible nonparametric models for such problems, but posterior inference with discrete responses typically requires approximation or simulation. We discuss an implementation of probability-scale beta and Dirichlet kernel models in the \pkg{BKP} package for \proglang{R}. The package implements the Beta Kernel Process (BKP), which uses kernel-weighted pseudo-count aggregation and beta-binomial conjugacy to obtain closed-form conjugate posterior summaries and posterior predictive distributions for binomial probabilities. It also implements the Dirichlet Kernel Process (DKP) for multi-class responses, together with TwinBKP and TwinDKP, scalable twinning-based global-local approximations for larger datasets. The resulting workflow supports transparent kernel-weighted evidence borrowing, several kernel families, fixed and data-adaptive priors, effective-sample-size calibration, loss-based hyperparameter tuning, and standard S3 methods for fitting, prediction, simulation, visualization, and extraction of posterior summaries. Reproducible examples demonstrate probability-surface estimation, binary and multi-class classification, computational comparison, and real-data applications to \emph{Loa loa} infection prevalence mapping and Mourning Warbler distribution modeling.

stat.CO↗

arXiv2026

High-dimensional reliability-based design optimization using stochastic emulators

Reliability-based design optimization (RBDO) is traditionally formulated as a nested optimization and reliability problem and remains computationally demanding, especially in high dimensions. This paper proposes a new RBDO framework based on a stochastic simulator viewpoint, in which the deterministic limit-state function and uncertain model inputs are combined into a unified stochastic representation. For a given design, the system response is characterized directly through its conditional output distribution rather than through an explicit limit-state function. Stochastic emulators are constructed in the design space to approximate this conditional distribution, enabling semi-analytical evaluation of failure probabilities or associated quantiles without Monte Carlo simulation. Two approaches are considered: generalized lambda models (GLaM) and stochastic polynomial chaos expansions (SPCE). Both yield deterministic mappings between design variables and reliability constraints, thereby eliminating the classical double-loop structure and enabling standard deterministic optimization. The approach is assessed on benchmark problems ranging from low to very high dimension, including stochastic excitation, and compared with Kriging in the full input space and heteroscedastic Gaussian processes in the design space. The proposed method provides substantial computational gains, particularly for high-dimensional random inputs, while retaining comparable efficiency to Kriging in low dimensions. Unlike heteroscedastic Gaussian processes, GLaM and SPCE also avoid restrictive assumptions on the conditional response distribution.

stat.CO↗

arXiv2026

Weak Poincaré inequalities for two-component Deterministic-scan Metropolis-within-Gibbs samplers

Using the framework of weak Poincaré inequalities, we analyze the convergence properties of deterministic-scan Metropolis-within-Gibbs samplers, an important class of Markov chain Monte Carlo algorithms. Our analysis applies to nonreversible Markov chains and yields explicit (subgeometric) convergence bounds through novel comparison techniques based on Dirichlet forms. We show that the joint chain inherits the convergence behavior of the marginal chain and conversely. In addition, we establish several fundamental results for weak Poincaré inequalities for discrete-time Markov chains, such as a tensorization property for independent chains. We apply our theoretical results through applications to algorithms for Bayesian inference for a hierarchical regression model and a diffusion model under discretely-observed data.

stat.CO↗