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.17885

Help | Advanced Search

Mathematics > Probability

arXiv:2504.17885 (math)
[Submitted on 24 Apr 2025 ]

Title: Maximal Inequalities for Independent Random Vectors

Title: 独立随机向量的最大不等式

Authors:Supratik Basu, Arun K Kuchibhotla
Abstract: Maximal inequalities refer to bounds on expected values of the supremum of averages of random variables over a collection. They play a crucial role in the study of non-parametric and high-dimensional estimators, and especially in the study of empirical risk minimizers. Although the expected supremum over an infinite collection appears more often in these applications, the expected supremum over a finite collection is a basic building block. This follows from the generic chaining argument. For the case of finite maximum, most existing bounds stem from the Bonferroni inequality (or the union bound). The optimality of such bounds is not obvious, especially in the context of heavy-tailed random vectors. In this article, we consider the problem of finding sharp upper and lower bounds for the expected $L_{\infty}$ norm of the mean of finite-dimensional random vectors under marginal variance bounds and an integrable envelope condition.
Abstract: 极大不等式是指关于随机变量集合上平均值的上确界期望值的界。它们在非参数估计和高维估计的研究中起着至关重要的作用,特别是在经验风险最小化器的研究中。尽管在这些应用中更常见的是无限集合上的期望上确界,但有限集合上的期望上确界是一个基本构建块。这源于通用链式论据。对于有限最大值的情况,大多数现有的界来源于邦弗伦尼不等式(或联合界)。这些界的最优性并不明显,特别是在重尾随机向量的情况下。本文中,我们考虑在边缘方差约束和可积包络条件下的有限维随机向量均值的$L_{\infty}$范数的期望的尖锐上下界的寻找问题。
Comments: This project originated from a 2019 proposal by the second author, in collaboration with Somabha Mukherjee (NUS) and Sagnik Nandy (University of Chicago). The current manuscript was developed independently, with some methodological overlap, particularly the use of results from Zubkov and Serov (2013) and Bentkus (2004) for lower bounds with bounded random vectors
Subjects: Probability (math.PR) ; Statistics Theory (math.ST)
Cite as: arXiv:2504.17885 [math.PR]
  (or arXiv:2504.17885v1 [math.PR] for this version)
  https://doi.org/10.48550/arXiv.2504.17885
arXiv-issued DOI via DataCite

Submission history

From: Arun Kuchibhotla [view email]
[v1] Thu, 24 Apr 2025 18:47:11 UTC (40 KB)
Full-text links:

Access Paper:

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