Metraipolis › archive › dc_b3430b4ffffa

Sharp upper and lower bounds on the variance of U-statistics — arXiv:2611.01690

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01690
License (as archived)
CC0-1.0
Archived
2026-11-03T18:46:32.754Z
SHA-256 of the archived text
946bd7fae8f22b162a4724db7a39b626d1f740294c10984021104f7b377b21a3
Stable URL of this page
https://metraipolis.com/documento/dc_b3430b4ffffa

How to cite

Sharp upper and lower bounds on the variance of U-statistics — arXiv:2611.01690 — arXiv (en), https://arxiv.org/abs/2611.01690 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b3430b4ffffa (Metraipolis archive dc_b3430b4ffffa, sha256 946bd7fae8f22b162a4724db7a39b626d1f740294c10984021104f7b377b21a3)
BibTeX
@misc{dcb3430b4ffffa,
  title = {Sharp upper and lower bounds on the variance of U-statistics — arXiv:2611.01690},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01690},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b3430b4ffffa; sha256 946bd7fae8f22b162a4724db7a39b626d1f740294c10984021104f7b377b21a3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01690. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For a U-statistic with a symmetric kernel of any rank, we offer new upper and lower bounds on its variance, which are uniformly sharper than those established in the classical paper by Hoeffding (1948, Theorem 5.2). Our new bounds have strong optimality properties and can tightly describe how the variance scales with the degree of the kernel. As an application, we leverage our new upper bound to improve an existing Berry-Esseen theorem for the normal approximation of incomplete U-statistics based on Bernoulli sampling, in a computationally frugal regime where the computational budget is much smaller than the available sample size.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.ST, nuovi lavori del giorno).
Categorie arXiv: Statistics Theory (math.ST) ; Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2611.01690 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:14:52.863Z dalla pagina https://arxiv.org/list/math.ST/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).