104 research outputs found
E<sup>3</sup>MSD - a new music information retrieval architecture for an original music identifier
Nonparametric Estimation of Large Spot Volatility Matrices for High-Frequency Financial Data
In this paper, we consider estimating spot/instantaneous volatility matrices
of high-frequency data collected for a large number of assets. We first combine
classic nonparametric kernel-based smoothing with a generalised shrinkage
technique in the matrix estimation for noise-free data under a uniform sparsity
assumption, a natural extension of the approximate sparsity commonly used in
the literature. The uniform consistency property is derived for the proposed
spot volatility matrix estimator with convergence rates comparable to the
optimal minimax one. For the high-frequency data contaminated by microstructure
noise, we introduce a localised pre-averaging estimation method that reduces
the effective magnitude of the noise. We then use the estimation tool developed
in the noise-free scenario, and derive the uniform convergence rates for the
developed spot volatility matrix estimator. We further combine the kernel
smoothing with the shrinkage technique to estimate the time-varying volatility
matrix of the high-dimensional noise vector. In addition, we consider large
spot volatility matrix estimation in time-varying factor models with observable
risk factors and derive the uniform convergence property. We provide numerical
studies including simulation and empirical application to examine the
performance of the proposed estimation methods in finite samples
On Talagrand's functional and generic chaining
In the study of the supremum of stochastic processes, Talagrand's chaining
functionals and his generic chaining method are heavily related to the
distribution of stochastic processes. In the present paper, we construct
Talagrand's type functionals in the general distribution case and obtain the
upper bound for the suprema of all -th moments of the stochastic process
using the generic chaining method. As applications, we obtained the
Johnson-Lindenstrauss lemma, the upper bound for the supremum of all -th
moment of order 2 Gaussian chaos, and convex signal recovery in our setting
Boosting nonnegative matrix factorization based community detection with graph attention auto-encoder
Improving NMF-based community discovery using distributed robust nonnegative matrix factorization with SimRank similarity measure
- …