Design based incomplete U-statistics
From MaRDI portal
Abstract: U-statistics are widely used in fields such as economics, machine learning, and statistics. However, while they enjoy desirable statistical properties, they have an obvious drawback in that the computation becomes impractical as the data size increases. Specifically, the number of combinations, say , that a U-statistic of order has to evaluate is . Many efforts have been made to approximate the original U-statistic using a small subset of combinations since Blom (1976), who referred to such an approximation as an incomplete U-statistic. To the best of our knowledge, all existing methods require to grow at least faster than , albeit more slowly than , in order for the corresponding incomplete U-statistic to be asymptotically efficient in terms of the mean squared error. In this paper, we introduce a new type of incomplete U-statistic that can be asymptotically efficient, even when grows more slowly than . In some cases, is only required to grow faster than . Our theoretical and empirical results both show significant improvements in the statistical efficiency of the new incomplete U-statistic.
Recommendations
Cites work
- A Class of Statistics with Asymptotically Normal Distribution
- Almost sure convergence of generalized U-statistics
- An invariance principle for reduced U-statistics
- Consistency and Unbiasedness of Certain Nonparametric Tests
- Consistency of the generalized bootstrap for degenerate \(U\)-statistics
- Fast surrogates of U-statistics
- Generalized bootstrap for studentized U-statistics: A rank statistic approach
- scientific article; zbMATH DE number 3850298 (Why is no real title available?)
- scientific article; zbMATH DE number 3928085 (Why is no real title available?)
- scientific article; zbMATH DE number 47948 (Why is no real title available?)
- scientific article; zbMATH DE number 775913 (Why is no real title available?)
- scientific article; zbMATH DE number 3352656 (Why is no real title available?)
- Incomplete U -statistics of permanent design
- Mathematical Statistics
- Minimum variance rectangular designs for U-statistics.
- On Incomplete U-Statistics Having Minimum Variance
- On the Asymptotic Distribution of Differentiable Statistical Functions
- Orthogonal Array-Based Latin Hypercubes
- ORTHOGONAL EXPANSIONS AND U-STATISTICS
- Random quadratic forms and the bootstrap for \(U\)-statistics
- Randomized incomplete \(U\)-statistics in high dimensions
- Reduced U-statistics and the Hodges-Lehmann estimator
- Some asymptotic theory for the bootstrap
- Some properties of incomplete U-statistics
- Strong orthogonal arrays and associated Latin hypercubes for computer experiments
- Testing for Stochastic Monotonicity
- Variance estimation of a general u-statistic with appllication to cross-validation
- Weak convergence of generalized U-statistics
Cited in
(12)- Incomplete generalized L-statistics
- Product-form estimators: exploiting independence to scale up Monte Carlo
- Edgeworth expansions for network moments
- Approximating high-dimensional infinite-order \(U\)-statistics: statistical and computational guarantees
- Fast surrogates of U-statistics
- U-statistics for some nonparametric incomplete data models with side information
- Scaling-up empirical risk minimization: optimization of incomplete U-statistics
- Incomplete U -statistics of permanent design
- U-statistics with conditional kernels for incomplete data models
- The divide-and-conquer sequential Monte Carlo algorithm: theoretical properties and limit theorems
- Asymptotic distributions of a new type of design-based incomplete U-statistics
- U-Statistic Reduction: Higher-Order Accurate Risk Control and Statistical-Computational Trade-Off
This page was built for publication: Design based incomplete U-statistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155202)