Abstract:Stochastic processes are often used to model complex scientific problems in fields ranging from biology and finance to engineering and physical science. This paper investigates rate-optimal estimation of the volatility matrix of a high-dimensional Itô process observed with measurement errors at discrete time points. The minimax rate of convergence is established for estimating sparse volatility matrices. By combining the multi-scale and threshold approaches we construct a volatility matrix estimator to achieve… Show more
“…For inference on the volatility matrix (in small dimensions) for continuous semi-martingales in a high-frequency regime we refer to [20,10] and references therein. Large sparse volatility matrix estimation for continuous Itô processes has been recently studied in [42,37,38].…”
The estimation of the diffusion matrix Σ of a high-dimensional, possibly timechanged Lévy process is studied, based on discrete observations of the process with a fixed distance. A low-rank condition is imposed on Σ. Applying a spectral approach, we construct a weighted least-squares estimator with nuclear-norm-penalisation. We prove oracle inequalities and derive convergence rates for the diffusion matrix estimator. The convergence rates show a surprising dependency on the rank of Σ and are optimal in the minimax sense for fixed dimensions. Theoretical results are illustrated by a simulation study.Résumé: In French.
“…For inference on the volatility matrix (in small dimensions) for continuous semi-martingales in a high-frequency regime we refer to [20,10] and references therein. Large sparse volatility matrix estimation for continuous Itô processes has been recently studied in [42,37,38].…”
The estimation of the diffusion matrix Σ of a high-dimensional, possibly timechanged Lévy process is studied, based on discrete observations of the process with a fixed distance. A low-rank condition is imposed on Σ. Applying a spectral approach, we construct a weighted least-squares estimator with nuclear-norm-penalisation. We prove oracle inequalities and derive convergence rates for the diffusion matrix estimator. The convergence rates show a surprising dependency on the rank of Σ and are optimal in the minimax sense for fixed dimensions. Theoretical results are illustrated by a simulation study.Résumé: In French.
“…Remark 13. As both p and n are allowed to go to infinity, if the micro-structure noises are sub-Gaussian, the drift and volatility are bounded, and the integrated volatility matrix is sparse, Tao et al [24] established the minimax convergence rate, π(p)[n −1/4 √ log p] 1−δ , and constructed a threshold MSRVM estimator to achieve the optimal convergence rate.…”
Section: Asymptotic Resultsmentioning
confidence: 99%
“…Cholesky decomposition implies that there is a lower triangular matrix, L, such that Σ(t) = L t L T t and dX t = µ t dt + L t dB t . As in the proof of Lemma 10 in [24], we can define a standard Brownian motion,…”
Section: A Appendixmentioning
confidence: 99%
“…When there are a large number of assets in financial practices such as asset pricing, portfolio allocation, and risk management, the volatility estimators designed for estimating a small integrated volatility matrix perform very poorly, and in fact, they are inconsistent when both the number of assets and sample size go to infinity [27]. For the case of a large number of assets, we need to impose some sparse structure on the integrated volatility matrix and employ regularization such as thresholding to obtain consistent estimators of the large volatility matrix [23,24,25]. In particular, Tao et al [23,24] investigated convergence rates of multi-scale realized volatility matrix estimator in the asymptotic framework that allows both the number of assets and sample size to go to infinity, and showed that the estimator achieves optimal convergence rate with respect to the sample size.…”
Section: Introductionmentioning
confidence: 99%
“…For the case of a large number of assets, we need to impose some sparse structure on the integrated volatility matrix and employ regularization such as thresholding to obtain consistent estimators of the large volatility matrix [23,24,25]. In particular, Tao et al [23,24] investigated convergence rates of multi-scale realized volatility matrix estimator in the asymptotic framework that allows both the number of assets and sample size to go to infinity, and showed that the estimator achieves optimal convergence rate with respect to the sample size. This paper considers the kernel realized volatility (KRV) [4,5], the pre-averaging realized volatility (PRV) [13,18], and the multi-scale realized volatility (MSRV) [23,30] based on generalized sampling time scheme.…”
In financial practices and research studies, we often encounter a large number of assets. The availability of high-frequency financial data makes it possible to estimate the large volatility matrix of these assets. Existing volatility matrix estimators such as kernel realized volatility and pre-averaging realized volatility perform poorly when the number of assets is very large, and in fact they are inconsistent when the number of assets and sample size go to infinity. In this paper, we introduce threshold rules to regularize kernel realized volatility, pre-averaging realized volatility, and multi-scale realized volatility. We establish asymptotic theory for these threshold estimators in the framework that allows the number of assets and sample size to go to infinity. Their convergence rates are derived under sparsity on the large integrated volatility matrix. In particular we have shown that the threshold kernel realized volatility and threshold pre-averaging realized volatility can achieve the optimal rate with respect to the sample size through proper bias corrections, but the bias adjustments causes the estimators to lose positive semi-definiteness; on the other hand, in order to be positive semi-definite, the threshold kernel realized volatility and threshold pre-averaging realized volatility have slower convergence rates with respect to the sample size. A simulation study is conducted to check the finite sample performances of the proposed threshold estimators with over hundred assets.H is a bandwidth parameter, and k(·) is a kernel function satisfying Assumption 2 and the following further assumption.Similar to the KRVM estimator, KRVPM estimator Γ KRVPM relies on jittering parameter J, bandwidth parameter H and kernel function k(·). As we will study in Section 4, theoretically J and H are selected to be of orders n 1/5 and n 3/5 , respectively, 6 Remark 3. Kernel realized volatility estimators Γ KRVM in Definition 2 and Γ KRVPM in Definition 3 have almost identical expressions, but their asymptotic behaviors are very different [4,5]. For example, when p is fixed and n goes to infinity, Γ KRVM has convergence rate n −1/4 , while Γ KRVPM can only achieve convergence rate n −1/5 . The slower convergence rate for Γ KRVPM
We introduce LASSO-type regularization for large-dimensional realized covariance estimators of log-prices. The procedure consists of shrinking the off-diagonal entries of the inverse realized covariance matrix towards zero. This technique produces covariance estimators that are positive definite and with a sparse inverse. We name the estimator realized network, since estimating a sparse inverse realized covariance matrix is equivalent to detecting the partial correlation network structure of the daily log-prices. The large sample consistency and selection properties of the estimator are established. An application to a panel of US blue chip stocks shows the advantages of the estimator for out-of-sample GMV asset allocation.
986
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.