Tail Bounds via Southwest Boundary

Abstract

We derive upper bounds for probabilities of the form P(g(X)≥ t) using the southwest boundary (recently introduced in our previous work) ∂SW Q(g-1[t,∞)), where Q is a reflection to the first quadrant. Under natural continuity, symmetry, and monotonicity assumptions on g, this yields explicit and computable bounds of the form P(g(X) t) nst, where st is the unique parameter at which the line L(s)=(f1-1(s),…,fn-1(s)) intersects the southwest boundary. In particular, when g is a homogeneous polynomial of degree k (plus a constant C) and all tail bounds on the random variables are identical, the bound proves to the closed-form expression P(g(X) t)≤ nf((t-C)1/k(Σi|ai|)1/k) where ai are the coefficients of the monomials in g. We then obtain an explicit tail bound for the trace of a Schur multiplier acting on random matrices with identical tail bounds on the random variables. No assumptions are made about independence or dependence.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…