Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2504.08435

Help | Advanced Search

Mathematics > Statistics Theory

arXiv:2504.08435 (math)
[Submitted on 11 Apr 2025 (v1) , last revised 3 Jun 2025 (this version, v2)]

Title: High-dimensional Gaussian and bootstrap approximations for robust means

Title: 高维高斯和自助法逼近稳健均值

Authors:Anders Bredahl Kock, David Preinerstorfer
Abstract: Recent years have witnessed much progress on Gaussian and bootstrap approximations to the distribution of max-type statistics of sums of independent random vectors with dimension $d$ large relative to the sample size $n$. However, for any number of moments $m>2$ that the summands may possess, there exist distributions such that these approximations break down if $d$ grows faster than $n^{\frac{m}{2}-1}$. In this paper, we establish Gaussian and bootstrap approximations to the distributions of winsorized and trimmed means that allow $d$ to grow at an exponential rate in $n$ as long as $m>2$ moments exist. The approximations remain valid under some amount of adversarial contamination. Our implementations of the winsorized and trimmed means are fully data-driven and do not depend on any unknown population quantities. As a consequence, the performance of the approximation guarantees ``adapts'' to $m$.
Abstract: 近年来,在高维独立随机向量之和的最大型统计量的分布的高斯逼近和自助法逼近方面取得了很大进展,其中随机向量的维度 $d$ 相对于样本容量 $n$ 较大。 然而,对于随机变量项可能具有的任意阶矩 $m>2$,若 $d$ 的增长速度超过 $n^{\frac{m}{2}-1}$,则这些逼近方法失效。 本文中,我们建立了高斯近似和自助法(bootstrap)近似来逼近 Winsorized 均值和修剪均值的分布,允许$d$在$n$中以指数速率增长,只要存在$m>2$阶矩。 在一定程度的对抗性污染下,这些近似仍然有效。 我们的 Winsorized 均值和修剪均值的实现完全是数据驱动的,并且不依赖于任何未知的总体量。 因此,近似的性能保证会“适应”$m$。
Subjects: Statistics Theory (math.ST)
Cite as: arXiv:2504.08435 [math.ST]
  (or arXiv:2504.08435v2 [math.ST] for this version)
  https://doi.org/10.48550/arXiv.2504.08435
arXiv-issued DOI via DataCite

Submission history

From: David Preinerstorfer [view email]
[v1] Fri, 11 Apr 2025 10:51:00 UTC (28 KB)
[v2] Tue, 3 Jun 2025 14:11:44 UTC (29 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
math.ST
< prev   |   next >
new | recent | 2025-04
Change to browse by:
math
stat
stat.TH

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号