Median-of-Incomplete-U-Statistics

• Median-of-Incomplete-U-Statistics (MIU) is a robust estimator that computes multiple incomplete U-statistics and aggregates them using the median to estimate symmetric kernel expectations.
• It unifies computational reduction via incomplete sampling with robustness from median-of-means aggregation, offering finite-sample concentration under both bounded and heavy-tailed conditions.
• MIU significantly reduces the computational burden from O(N^k) to O(MT) while preserving key statistical guarantees and adapting to various moment conditions.

Searching arXiv for papers on MIU, robust U-statistics, and incomplete U-statistics to ground the article in the cited literature. Median-of-Incomplete-U-Statistics (MIU) denotes a robust and computationally efficient estimator for the expectation of a symmetric kernel, obtained by computing multiple incomplete U-statistics and aggregating them by a median rather than by a mean. In the recent formalization of the method, one observes an i.i.d. sample $S_N=\{X_j\}_{j=1}^N$, considers a symmetric kernel $h:\mathcal{X}^k\to\mathbb{R}$ of order $k$, and targets $\theta=\mathbb{E}[h(X_1,\ldots,X_k)]$ (Hieu, 30 May 2026). The MIU construction combines two ideas that had largely developed separately: incomplete U-statistics for reducing the $O(N^k)$ cost of complete U-statistics, and median-of-means style aggregation for robustifying estimates against unstable subsamples or heavy-tailed behavior (Maurer, 2022, Joly et al., 2015, Hieu, 30 May 2026). In the literature, the terminology is not uniform: the 2015 robust U-statistics paper does not use the name MIU, but its median-of-means U-estimator is exactly interpretable as a median over incomplete U-statistics induced by blockwise tuple sets (Joly et al., 2015).

1. Formal definition and relation to classical U-statistics

Let $Q$ be a probability distribution on a measurable space $(\mathcal{X},\mathcal{A})$, and let $X_1,\ldots,X_N$ be i.i.d. draws from $Q$. For a symmetric kernel $h:\mathcal{X}^k\to\mathbb{R}$, the target functional is

$h:\mathcal{X}^k\to\mathbb{R}$0

The complete U-statistic of order $h:\mathcal{X}^k\to\mathbb{R}$1 is

$h:\mathcal{X}^k\to\mathbb{R}$2

where $h:\mathcal{X}^k\to\mathbb{R}$3 is the set of all $h:\mathcal{X}^k\to\mathbb{R}$4-combinations from $h:\mathcal{X}^k\to\mathbb{R}$5 (Hieu, 30 May 2026). This estimator is unbiased for $h:\mathcal{X}^k\to\mathbb{R}$6, but its computational cost is $h:\mathcal{X}^k\to\mathbb{R}$7, which becomes prohibitive for large $h:\mathcal{X}^k\to\mathbb{R}$8 or moderate $h:\mathcal{X}^k\to\mathbb{R}$9 (Hieu, 30 May 2026).

An incomplete U-statistic replaces the exhaustive average over all $k$0-tuples by an average over a sampled subset. In the with-replacement formulation analyzed in the 2026 MIU paper, one samples $k$1 $k$2-subsets uniformly from $k$3 and computes

$k$4

Conditional on the observed sample $k$5, this is unbiased for the complete U-statistic: $k$6 and its conditional variance is

$k$7

with

$k$8

(Hieu, 30 May 2026).

The MIU estimator repeats this incomplete-sampling step independently $k$9 times and takes a median: $\theta=\mathbb{E}[h(X_1,\ldots,X_k)]$0 In the main finite-sample theorem of the 2026 paper, the number of replications is chosen as

$\theta=\mathbb{E}[h(X_1,\ldots,X_k)]$1

for confidence level $\theta=\mathbb{E}[h(X_1,\ldots,X_k)]$2 (Hieu, 30 May 2026).

This median aggregation distinguishes MIU from the incomplete-U procedures used in other settings. For example, semialgebraic hypothesis testing with incomplete U-statistics uses randomized incomplete U-statistics aggregated by averaging and calibrated through a Gaussian multiplier bootstrap, not by medians; that line of work explicitly does not provide theory for an MIU variant (Barnhill et al., 17 Jul 2025).

2. Historical development and the MIU interpretation of robust U-estimation

The conceptual roots of MIU lie in robust estimation for multivariate kernels under heavy tails. The 2015 paper "Robust estimation of U-statistics" introduced a median-of-means style robust estimator for the mean of a multivariate kernel and developed nonasymptotic guarantees under minimal moment assumptions (Joly et al., 2015). Its construction begins with a regular partition $\theta=\mathbb{E}[h(X_1,\ldots,X_k)]$3 of $\theta=\mathbb{E}[h(X_1,\ldots,X_k)]$4 satisfying

$\theta=\mathbb{E}[h(X_1,\ldots,X_k)]$5

and then forms decoupled block-level U-statistics across distinct blocks: $\theta=\mathbb{E}[h(X_1,\ldots,X_k)]$6 where $\theta=\mathbb{E}[h(X_1,\ldots,X_k)]$7 (Joly et al., 2015).

The robust estimator is then

$\theta=\mathbb{E}[h(X_1,\ldots,X_k)]$8

Although the paper calls this a “median-of-means”-style robust U-estimator, it is exactly a median over incomplete U-statistics defined on specific subsets of $\theta=\mathbb{E}[h(X_1,\ldots,X_k)]$9; each cross-block Cartesian product yields an incomplete U-statistic, and the final estimate is their median (Joly et al., 2015). This is the precise sense in which the construction can be called a Median-of-Incomplete-U-Statistics estimator.

That identification matters because it unifies two previously separate motivations. One motivation is robustness under weak moment assumptions, central to the 2015 paper (Joly et al., 2015). The other is computational reduction through incomplete tuple sampling, central to the literature on incomplete U-statistics and to recent finite-sample analyses of randomized designs (Maurer, 2022, Hieu, 30 May 2026). The MIU terminology makes explicit that both properties arise from the same estimator template: choose multiple tuple subsets $O(N^k)$0, compute the corresponding incomplete U-statistics, and aggregate them by a median.

A persistent source of confusion is that not every incomplete-U method is an MIU. The SDL semialgebraic testing framework constructs a single randomized incomplete U-statistic

$O(N^k)$1

then studentizes and bootstraps it; there is no median aggregation, and the paper explicitly notes that no theory is provided for replacing this averaging step by a median-of-incomplete-U-statistics aggregator (Barnhill et al., 17 Jul 2025).

3. Statistical guarantees under bounded kernels

The first dedicated finite-sample concentration analysis for MIU appears in "On Median of Incomplete U-Statistics" (Hieu, 30 May 2026). The main theorem assumes a bounded symmetric kernel,

$O(N^k)$2

and establishes that, for any $O(N^k)$3 and $O(N^k)$4, with probability at least $O(N^k)$5,

$O(N^k)$6

The two terms have distinct meanings (Hieu, 30 May 2026). The second term is the deviation of the complete U-statistic from the target parameter, obtained through a Hoeffding-type concentration inequality for bounded U-statistics. The first term is the Monte Carlo error introduced by incomplete sampling and controlled by median aggregation across the $O(N^k)$7 repetitions.

This decomposition yields the rate statement emphasized in the paper: the complete-statistic contribution scales as

$O(N^k)$8

up to the floor $O(N^k)$9, while the incomplete-sampling contribution scales as

$Q$0

(Hieu, 30 May 2026). Since $Q$1, choosing $Q$2 makes the MIU error match the complete U-statistic rate up to logarithmic factors while requiring only $Q$3 kernel evaluations rather than $Q$4 (Hieu, 30 May 2026).

The proof proceeds by conditioning on the observed dataset. Conditional on $Q$5, each incomplete U-statistic $Q$6 is an average of $Q$7 i.i.d. draws from the finite population

$Q$8

with variance $Q$9 (Hieu, 30 May 2026). A median-of-means concentration bound is then applied conditionally, and the result is combined with a Hoeffding-type deviation bound for the complete U-statistic. This suggests that, in the bounded-kernel regime, the median step primarily robustifies the stochastic error caused by randomized incompleteness rather than the data distribution itself.

4. Heavy tails, degeneracy, and robust rates beyond boundedness

The most substantive robustness theory relevant to MIU originates in the heavy-tailed U-statistics literature rather than in the 2026 bounded-kernel note. The 2015 paper establishes that classical U-statistics can fail badly under heavy tails. Its motivating example takes $(\mathcal{X},\mathcal{A})$0 and $(\mathcal{X},\mathcal{A})$1 with $(\mathcal{X},\mathcal{A})$2 heavy-tailed and $(\mathcal{X},\mathcal{A})$3-canonical. For $(\mathcal{X},\mathcal{A})$4-stable $(\mathcal{X},\mathcal{A})$5 with $(\mathcal{X},\mathcal{A})$6, the paper shows

$(\mathcal{X},\mathcal{A})$7

for some $(\mathcal{X},\mathcal{A})$8 depending only on $(\mathcal{X},\mathcal{A})$9, ruling out fast sub-Gaussian behavior in that regime (Joly et al., 2015).

Against this background, the median-based block estimator—equivalently, an MIU over block-induced incomplete U-statistics—achieves nonasymptotic bounds under minimal moment conditions (Joly et al., 2015). For a symmetric kernel that is $X_1,\ldots,X_N$0-degenerate of order $X_1,\ldots,X_N$1 and has finite variance $X_1,\ldots,X_N$2, if $X_1,\ldots,X_N$3 and the regular partition satisfies $X_1,\ldots,X_N$4, then with probability at least $X_1,\ldots,X_N$5,

$X_1,\ldots,X_N$6

In the canonical case $X_1,\ldots,X_N$7, the rate becomes

$X_1,\ldots,X_N$8

matching the fast canonical rates known for bounded kernels, but now under only finite variance (Joly et al., 2015).

The paper also treats weaker moment assumptions. If $X_1,\ldots,X_N$9 is $Q$0-canonical and there exists $Q$1 such that

$Q$2

then with the same block choice and probability at least $Q$3,

$Q$4

For $Q$5 and heavy tails such as $Q$6-stable laws with $Q$7, the paper states that this rate is essentially optimal (Joly et al., 2015).

These results matter for MIU in two ways. First, they show that median aggregation over incomplete or partially decoupled U-statistics can retain the favorable rates of classical U-statistics even when boundedness fails. Second, they identify the structural condition responsible for the rate exponent: degeneracy in the Hoeffding sense. A plausible implication is that any MIU design that preserves sufficiently weak dependence and comparable blockwise moment control can inherit the same median-of-means boosting mechanism, though that extrapolation is a methodological interpretation rather than a theorem stated in the 2026 bounded-kernel paper.

5. Computational structure and design trade-offs

The primary computational motivation for MIU is the gap between the cost of complete U-statistics and that of incomplete sampling. For a kernel of order $Q$8, complete evaluation requires

$Q$9

kernel computations (Joly et al., 2015). In the 2026 MIU construction, computing $h:\mathcal{X}^k\to\mathbb{R}$0 incomplete U-statistics with $h:\mathcal{X}^k\to\mathbb{R}$1 sampled tuples each requires only $h:\mathcal{X}^k\to\mathbb{R}$2 kernel evaluations (Hieu, 30 May 2026). When $h:\mathcal{X}^k\to\mathbb{R}$3, the computational reduction is substantial.

The 2015 blockwise construction clarifies that not all incomplete designs deliver the same computational profile (Joly et al., 2015). For the decoupled cross-block estimator $h:\mathcal{X}^k\to\mathbb{R}$4, there are $h:\mathcal{X}^k\to\mathbb{R}$5 block tuples, each contributing about $h:\mathcal{X}^k\to\mathbb{R}$6 terms in a regular partition, so the total number of terms is

$h:\mathcal{X}^k\to\mathbb{R}$7

which is comparable to the complete U-statistic. This design is statistically robust but not automatically computationally cheaper.

By contrast, the “diagonal” variant that takes the median of per-block complete U-statistics uses only

$h:\mathcal{X}^k\to\mathbb{R}$8

terms, which can be much smaller when $h:\mathcal{X}^k\to\mathbb{R}$9 is moderate or large (Joly et al., 2015). The same paper further notes that one may subsample within each cross-block Cartesian product, replacing the full product set by a random subset of fixed size. That produces a randomized MIU with reduced cost while retaining the median-of-means principle (Joly et al., 2015).

The 2022 paper on incomplete U-statistics provides a complementary perspective by quantifying the statistical cost of incompleteness under bounded symmetric kernels $h:\mathcal{X}^k\to\mathbb{R}$00 (Maurer, 2022). For random designs sampled with replacement over $h:\mathcal{X}^k\to\mathbb{R}$01-subsets, it proves a Bernstein-type bound whose additional incompleteness penalty decays as $h:\mathcal{X}^k\to\mathbb{R}$02. It also states that once the number of sampled subsamples reaches the square of the sample size, the incomplete-statistic bound attains the same order as that of the complete U-statistic (Maurer, 2022). In the paper’s phrasing, this is the sense in which “as soon as the number of subsamples reaches the square of the sample-size, the same order bound is obtained as for the complete statistic.”

The relation between that result and MIU is indirect but important. The 2022 paper does not analyze median aggregation as such; instead, it supplies variance-sensitive concentration for base incomplete U-statistics (Maurer, 2022). This suggests a design principle for MIU: construct incomplete U-statistics whose per-replicate concentration is already controlled, then use the median only to upgrade confidence and robustness.

6. Extensions, applications, and neighboring frameworks

The robust U-statistics paper develops a clustering application that is naturally expressible in MIU language (Joly et al., 2015). For a dissimilarity $h:\mathcal{X}^k\to\mathbb{R}$03 and partition class $h:\mathcal{X}^k\to\mathbb{R}$04 with $h:\mathcal{X}^k\to\mathbb{R}$05, define

$h:\mathcal{X}^k\to\mathbb{R}$06

Replacing the empirical clustering risk by its median-of-means U-statistic analogue $h:\mathcal{X}^k\to\mathbb{R}$07, the paper proves that, assuming $h:\mathcal{X}^k\to\mathbb{R}$08, for $h:\mathcal{X}^k\to\mathbb{R}$09, $h:\mathcal{X}^k\to\mathbb{R}$10, and $h:\mathcal{X}^k\to\mathbb{R}$11, with probability at least $h:\mathcal{X}^k\to\mathbb{R}$12,

$h:\mathcal{X}^k\to\mathbb{R}$13

If $h:\mathcal{X}^k\to\mathbb{R}$14, then

$h:\mathcal{X}^k\to\mathbb{R}$15

(Joly et al., 2015). Under a low-noise condition, the same section gives a faster rate

$h:\mathcal{X}^k\to\mathbb{R}$16

(Joly et al., 2015). This suggests that MIU-type constructions are useful not only for scalar estimation but also for empirical-risk minimization with U-process structure.

A different extension appears in Banach-valued U-statistics (Giraudo, 2024). That paper derives deviation inequalities for Banach-valued U-statistics and an $h:\mathcal{X}^k\to\mathbb{R}$17 moment inequality for Bernoulli incomplete U-statistics, then shows how these can be combined with blockwise robust aggregation. For symmetric kernels degenerate of order $h:\mathcal{X}^k\to\mathbb{R}$18, the paper gives moment control for normalized incomplete estimators under $h:\mathcal{X}^k\to\mathbb{R}$19-smooth Banach-space assumptions, and its exposition notes that partitioning the data into blocks and taking a metric or coordinatewise median yields a high-probability MIU-type bound (Giraudo, 2024). This suggests a broader functional-analytic setting for MIU beyond real-valued kernels.

At the same time, neighboring literatures show what MIU is not. The 2025 semialgebraic testing paper studies randomized incomplete U-statistics in a high-dimensional, bootstrap-calibrated testing pipeline, but its aggregation is by averaging and maximization across constraints, not by medians (Barnhill et al., 17 Jul 2025). The paper explicitly states that if one were to replace averaging by a median-of-incomplete-U-statistics aggregator, neither theory nor calibration is currently provided (Barnhill et al., 17 Jul 2025). This delineates MIU as an estimator family rather than a generic label for all incomplete-U methods.

7. Methodological issues, misconceptions, and open directions

A common misconception is that MIU is a single universally standardized estimator. In fact, the literature contains at least three distinct constructions that fit the label to different degrees: repeated with-replacement incomplete U-statistics followed by a scalar median (Hieu, 30 May 2026); blockwise medians over cross-block or within-block incomplete U-statistics induced by sample partitioning (Joly et al., 2015); and generalized blockwise robust aggregation schemes in Banach spaces using metric medians (Giraudo, 2024). They share the same architectural principle but differ in dependence structure, moment assumptions, and proof techniques.

A second misconception is that MIU is always motivated by heavy tails. The recent dedicated MIU concentration theorem assumes bounded kernels and uses the median step mainly to control incomplete-sampling noise (Hieu, 30 May 2026). Heavy-tail robustness enters more prominently in the earlier robust U-statistics framework, where the blockwise median construction compensates for the failure of classical U-statistics under weak moments (Joly et al., 2015). Thus bounded-kernel MIU and heavy-tailed robust MIU are related but not identical regimes.

The main open issue is theoretical unification. The 2026 MIU note gives explicit finite-sample concentration under boundedness (Hieu, 30 May 2026). The 2015 robust U-statistics paper gives heavy-tail guarantees for a construction that is exactly MIU in form but not named as such (Joly et al., 2015). The 2022 incomplete-U paper supplies sharper Bernstein-type control for base incomplete estimators (Maurer, 2022). The Banach-valued paper extends the setting to vector-valued kernels and moment inequalities under geometric assumptions (Giraudo, 2024). What remains largely absent is a single framework that simultaneously handles arbitrary incomplete-design families, heavy-tailed kernels, and sharp finite-sample constants under median aggregation.

Another open direction concerns dependence and calibration. The with-replacement MIU analysis in the 2026 paper relies on conditional i.i.d. sampling from the finite population of kernel evaluations (Hieu, 30 May 2026). The blockwise robust theory in the 2015 paper relies on weakly dependent cross-block summaries and a median-of-means boosting argument (Joly et al., 2015). Frameworks such as the SDL test show that once studentization, max-type functionals, and multiplier bootstrap calibration are introduced, replacing averages by medians becomes nontrivial and is not covered by existing results (Barnhill et al., 17 Jul 2025).

Overall, MIU occupies the intersection of robust statistics, U-process theory, and randomized approximation. Its core promise is to preserve the statistical content of U-statistics while reducing computational burden and, in appropriate designs, improving robustness. The precise guarantee depends strongly on the regime: bounded-kernel concentration in the recent dedicated MIU theorem (Hieu, 30 May 2026), minimal-moment heavy-tail robustness in blockwise robust U-estimation (Joly et al., 2015), variance-sensitive incomplete-U concentration in Bernstein form (Maurer, 2022), and Banach-valued extensions under $h:\mathcal{X}^k\to\mathbb{R}$20-smoothness assumptions (Giraudo, 2024).