In a recent paper we have introduced the class of realised kernel estimators of the increments of quadratic variation in the presence of noise. We showed that this estimator is consistent and derived its limit distribution under various assumptions on the kernel weights. In this paper we extend our analysis, looking at the class of subsampled realised kernels and we derive the limit theory for this class of estimators. We find that subsampling is highly advantageous for estimators based on discontinuous kernels, such as the truncated kernel. For kinked kernels, such as the Bartlett kernel, we show that subsampling is impotent, in the sense that subsampling has no effect on the asymptotic distribution. Perhaps surprisingly, for the efficient...
International audienceThere has been a recent surge of interest in nonparametric bandit algorithms b...
This paper discusses inference in self-exciting threshold autoregressive (SETAR) models. Of main int...
We propose randomized techniques for speeding up Kernel Principal Component Analysis on three levels...
In a recent paper we have introduced the class of realised kernel estimators of the increments of qu...
In a recent paper we have introduced the class of realised kernel estimators of the increments of qu...
We study Nystr\uf6m type subsampling approaches to large scale kernel methods, and prove learning bo...
A new class of kernels for long-run variance and spectral density estimation is developed by exponen...
We investigate the use of subsampling for conducting inference about the quadratic variation of a di...
Kim and Pollard (1990) showed that a general class of M-estimators converge at rate nl/3 rather than...
Kim and Pollard (Annals of Statistics, 18 (1990) 191?219) showed that a general class of M-estimator...
We study kernel quadrature rules with convex weights. Our approach combines the spectral properties ...
In this paper, we construct a new class of kernel by exponentiating conventional kernels and use the...
A general approach to constructing confidence intervals by subsampling was presented in Politis and ...
This thesis presents an investigation into the estimator for the rate of convergence of a sequence o...
We study kernel quadrature rules with convex weights. Our approach combines the spectral properties ...
International audienceThere has been a recent surge of interest in nonparametric bandit algorithms b...
This paper discusses inference in self-exciting threshold autoregressive (SETAR) models. Of main int...
We propose randomized techniques for speeding up Kernel Principal Component Analysis on three levels...
In a recent paper we have introduced the class of realised kernel estimators of the increments of qu...
In a recent paper we have introduced the class of realised kernel estimators of the increments of qu...
We study Nystr\uf6m type subsampling approaches to large scale kernel methods, and prove learning bo...
A new class of kernels for long-run variance and spectral density estimation is developed by exponen...
We investigate the use of subsampling for conducting inference about the quadratic variation of a di...
Kim and Pollard (1990) showed that a general class of M-estimators converge at rate nl/3 rather than...
Kim and Pollard (Annals of Statistics, 18 (1990) 191?219) showed that a general class of M-estimator...
We study kernel quadrature rules with convex weights. Our approach combines the spectral properties ...
In this paper, we construct a new class of kernel by exponentiating conventional kernels and use the...
A general approach to constructing confidence intervals by subsampling was presented in Politis and ...
This thesis presents an investigation into the estimator for the rate of convergence of a sequence o...
We study kernel quadrature rules with convex weights. Our approach combines the spectral properties ...
International audienceThere has been a recent surge of interest in nonparametric bandit algorithms b...
This paper discusses inference in self-exciting threshold autoregressive (SETAR) models. Of main int...
We propose randomized techniques for speeding up Kernel Principal Component Analysis on three levels...