English

Instance-dependent uniform tail bounds for empirical processes

Probability 2026-03-27 v7 Statistics Theory Machine Learning Statistics Theory

Abstract

We formulate a uniform tail bound for empirical processes indexed by a class of functions, in terms of the individual deviations of the functions rather than the worst-case deviation in the considered class. The tail bound is established by introducing an initial ``deflation'' step to the standard generic chaining argument. The resulting tail bound is the sum of the complexity of the ``deflated function class'' in terms of a generalization of Talagrand's γ\gamma functional, and the deviation of the function instance, both of which are formulated based on the natural seminorm induced by the corresponding Cram\'{e}r functions. Leveraging another less demanding natural seminorm, we also show similar bounds, though with implicit dependence on the sample size, in the more general case where finite exponential moments cannot be assumed. We also provide approximations of the tail bounds in terms of the more prevalent Orlicz norms or their ``incomplete'' versions under suitable moment conditions.

Keywords

Cite

@article{arxiv.2209.10053,
  title  = {Instance-dependent uniform tail bounds for empirical processes},
  author = {Sohail Bahmani},
  journal= {arXiv preprint arXiv:2209.10053},
  year   = {2026}
}

Comments

accepted for publication in IEEE Transactions on Information Theory

R2 v1 2026-06-28T01:46:53.054Z