SearcharxivSearch

arXiv · 2506.01094

A Semiparametric Stochastic Volatility Model with Dependent Errors

Abstract

This paper proposes a semiparametric stochastic volatility (SV) model that relaxes the restrictive Gaussian assumption in both the return and volatility error terms, allowing them to follow flexible, nonparametric distributions with potential dependence. By integrating this framework into a Bayesian Markov Chain Monte Carlo (MCMC) approach, the model effectively captures the heavy tails, skewness, and other complex features often observed in financial return data. Simulation studies under correlated Gaussian and Student's t error settings demonstrate that the proposed method achieves lower bias and variance when estimating model parameters and volatility compared to traditional Gaussian-based and popular Bayesian implementations. We conduct an empirical application to the real world financial data, which further underscores the model's practical advantages: it provides volatility estimates that respond more accurately to large fluctuations, reflecting real-world market behavior. These findings suggest that the introduced semiparametric SV framework offers a more robust and adaptable tool for financial econometrics, particularly in scenarios characterized by non-Gaussian and dependent return dynamics.

Explore related subjects

Keep this discovery

BibTeXRIS

Yudong Feng, Ashis Gangopadhyay. 2025-06-01. A Semiparametric Stochastic Volatility Model with Dependent Errors. https://arxiv.org/abs/2506.01094

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

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO