We prove a sharp Bernstein inequality for general-state-space and not necessarily reversible Markov chains. It is sharp in the sense that the variance proxy term is optimal. Our result covers the classical Bernstein's inequality for independent random variables as a special case.

Several large volatility matrix estimation procedures have been recently developed for factor-based It processes whose integrated volatility matrix consists of low-rank and sparse matrices. Their performance depends on the accuracy of input volatility matrix estimators. When estimating co-volatilities based on high-frequency data, one of the crucial challenges is non-synchronization for illiquid assets, which makes their co-volatility estimators inaccurate. In this paper, we study how to estimate the large integrated volatility matrix without using co-volatilities of illiquid assets. Specifically, we pretend that the co-volatilities for illiquid assets are missing, and estimate the low-rank matrix using a matrix completion scheme with a structured missing pattern. To further regularize the sparse volatility matrix, we employ the principal orthogonal complement thresholding method (POET). We also investigate the asymptotic

Several novel large volatility matrix estimation methods have been developed based on the high-frequency financial data. They often employ the approximate factor model that leads to a low-rank plus sparse structure for the integrated volatility matrix and facilitates estimation of large volatility matrices. However, for predicting future volatility matrices, these nonparametric estimators do not have a dynamic structure to implement. In this paper, we introduce a novel It diffusion process based on the approximate factor models and call it a factor GARCH-It model. We then investigate its properties and propose a quasi-maximum likelihood estimation method for the parameter of the factor GARCH-It model. We also apply it to estimating conditional expected large volatility matrices and establish their asymptotic properties. Simulation studies are conducted to validate the finite sample performance of the proposed

We propose a novel technique to boost the power of testing a highdimensional vector <i>H</i>:<i><b></b></i>=<b>0</b> against sparse alternatives where the null hypothesis is violated by only a few components. Existing tests based on quadratic forms such as the Wald statistic often suffer from low powers due to the accumulation of errors in estimating highdimensional parameters. More powerful tests for sparse alternatives such as thresholding and extreme value tests, on the other hand, require either stringent conditions or bootstrap to derive the null distribution and often suffer from size distortions due to the slow convergence. Based on a screening technique, we introduce a power enhancement component, which is zero under the null hypothesis with high probability, but diverges quickly under sparse alternatives. The proposed test statistic combines the power enhancement component with an asymptotically pivotal statistic, and

Motivated by the sampling problems and heterogeneity issues common in high-dimensional big datasets, we consider a class of discordant additive index models. We propose method of moments based procedures for estimating the indices of such discordant additive index models in both low and high-dimensional settings. Our estimators are based on factorizing certain moment tensors and are also applicable in the overcomplete setting, where the number of indices is more than the dimensionality of the datasets. Furthermore, we provide rates of convergence of our estimator in both high and low-dimensional setting. Establishing such results requires deriving tensor operator norm concentration inequalities that might be of independent interest. Finally, we provide simulation results supporting our theory. Our contributions extend the applicability of tensor methods for novel models in addition to making progress on understanding theoretical properties of such tensor methods.