Randomized incomplete U-statistics in high dimensions

From MaRDI portal
Publication:2284368



Abstract: This paper studies inference for the mean vector of a high-dimensional U-statistic. In the era of Big Data, the dimension d of the U-statistic and the sample size n of the observations tend to be both large, and the computation of the U-statistic is prohibitively demanding. Data-dependent inferential procedures such as the empirical bootstrap for U-statistics is even more computationally expensive. To overcome such computational bottleneck, incomplete U-statistics obtained by sampling fewer terms of the U-statistic are attractive alternatives. In this paper, we introduce randomized incomplete U-statistics with sparse weights whose computational cost can be made independent of the order of the U-statistic. We derive non-asymptotic Gaussian approximation error bounds for the randomized incomplete U-statistics in high dimensions, namely in cases where the dimension d is possibly much larger than the sample size n, for both non-degenerate and degenerate kernels. In addition, we propose generic bootstrap methods for the incomplete U-statistics that are computationally much less-demanding than existing bootstrap methods, and establish finite sample validity of the proposed bootstrap methods. Our methods are illustrated on the application to nonparametric testing for the pairwise independence of a high-dimensional random vector under weaker assumptions than those appearing in the literature.


The authors consider the problem of statistical inference for the mean vector \(\mathbb{E}h(X_1,\ldots,X_r)\), based on independent and identically distributed data \(X_1,\ldots,X_n\) taking values in a measurable space \((S,\mathcal{S})\), and where \(h:S^r\mapsto\mathbb{R}^d\) is a fixed, symmetric function. Their aim is to develop tools for the setting where \(d\) is possibly much larger than \(n\), but where \(n\) is also large. In this setting, the commonly used \(U\)-statistic \[ \frac{1}{|I_{n,r}|}\sum_{(i_1,\ldots,i_r)\in I_{n,r}}h(X_{i_1},\ldots,X_{i_r})\,, \] where \(I_{n,r}\) is the set of all \(r\)-tuples in \(\{1,\ldots,n\}\), suffers from problems of computational scalability. As a solution to this, the authors propose two randomized incomplete \(U\)-statistics, where the average is taken over only a randomly chosen subset of \(I_{n,r}\), rather than over all elements of this set. The first of these uses Bernoulli sampling (or, equivalently, sampling without replacement), and the second uses sampling with replacement. Under some assumptions (such as some boundedness assumptions), Gaussian approximation results are established for these randomized incomplete \(U\)-statistics, with an explicit rate of convergence, in both the nondegenerate and degenerate cases. Since the limiting Gaussian distribution here has a covariance matrix depending on the unknown underlying distribution, fully data-dependent bootstrap techniques are developed which make these results applicable. The paper concludes with a simulation study investigating this framework in the setting of testing for pairwise independence of elements of a high-dimensional random vector using several well-known statistics from the literature.



Cites work


Cited in
(38)








This page was built for publication: Randomized incomplete \(U\)-statistics in high dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284368)