The Exact Worst-Case Tail Probability under Bounded Kurtosis

• URL: http://arxiv.org/abs/2607.05226v2
• Date: Tue, 07 Jul 2026 15:33:32 GMT
• Title: The Exact Worst-Case Tail Probability under Bounded Kurtosis
• Abstract summary: We determine exactly what a kurtosis bound buys for one-sided tail control.<n>For the class $mathcalC()$ of real random variables with mean $0$, variance $1$, and fourth moment at most $$, the skewness left free.
• Score: 39.91890433860882
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We determine exactly what a kurtosis bound buys for one-sided tail control. For the class $\mathcal{C}(κ)$ of real random variables with mean $0$, variance $1$, and fourth moment at most $κ$, the skewness left free, we compute the worst-case tail probability $V_1(t,κ)=\sup_{X\in\mathcal{C}(κ)}\mathbb{P}(X\geq t)$ for every threshold $t>0$ and every $κ\geq 1$. The answer is a four-regime map: a Cantelli tongue $b(κ)\le t\le c(κ)$ on which the two-moment bound $1/(1+t^2)$ remains tight and the kurtosis constraint is worthless; a tail regime $t\geq c(κ)$ with the closed form $V_1=(κ-1)/((t^2-1)^2+κ-1)$; a plateau regime, present only for $κ\le 3/2$, on which the worst case freezes and the value does not depend on $t$; and a central regime described exactly by an explicit algebraic system, provably admitting no closed form in nested square roots. Beyond $c(κ)$ the one-sided and two-sided worst cases coincide: Cantelli's improvement over Chebyshev is annihilated by fourth-moment information. The minimal degree of a sum-of-squares proof of the tight bound is $2$ on the closed tongue and $4$ everywhere else, an exact phase diagram of proof degree. Every closed-form regime carries an explicit dual certificate and an explicit extremal distribution, re-verified on parameter grids by an independent checker in exact arithmetic. The closed forms invert to exact worst-case quantiles, sharpen a median-of-means constant, and give the exact per-direction tail available to degree-4 reasoning under certifiable kurtosis. We found the map through an AI-guided search around the certifying pipeline, LemmaForge, which is validated on classical benchmarks, independently reproduces the symmetric-slice bound of Zelen (1954), and recovers the $2\sqrt{3}-3$ constant of He, Zhang, and Zhang (2010) at $t=0$.

Related papers

• Exact Risk Ratios for Weighted Data Selection in Linear Regression [0.0]
  Hanneke, Moran, Shlimovich and Yehudayoff (COLT 2025) posed the following open problem.<n>A selector sees a finite dataset $D subseteq mathbbRd times mathbbR$, picks at most $n$ examples together with nonnegative weights, and hands the weighted least squares objective to the minimum-norm ERM.<n>We give explicit counterexamples showing that several shorter routes fail, and constructive sign-time selection algorithms for all proved cases.
  arXiv  Detail & Related papers  (2026-08-28T07:19:17Z)
• The sharp SAT/UNSAT phase transition in random ellipsoid fitting [5.7652356955571085]
  An emphellipsoid fit is a matrix $S succeq 0$ such that $x_itop S x_i =d$ for every $i$.<n>We prove Saunderson, Parrilo and Willsky's conjecture that, as $n,d to infty$, this semidefinite feasibility problem undergoes a sharp transition at $n sim d2/4$.
  arXiv  Detail & Related papers  (2026-08-10T19:55:11Z)
• The Condition-Number Barrier in Sparse Least Squares [77.64108812086542]
  In [AS21], Axiotis and Sviridenko conjectured that the linear dependence on the restricted condition number in convex optimization cannot be improved by a sparse-time algorithm.<n>We establish their conjectured lower bound for least-squares objectives, conditional on the randomized exact-volume Small-Set Expansion Hypothesis.
  arXiv  Detail & Related papers  (2026-08-03T17:57:01Z)
• A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph [0.0]
  Conway's 99-graph problem asks whether a strongly regular graph with parameters $mathrmsrg(99,14,1,2)$ exists.<n>We report a systematic, fully reproducible attack by an autonomous AI research agent.
  arXiv  Detail & Related papers  (2026-07-13T18:42:21Z)
• Gradient-Free Warm-Start Library Recovery: an Amortized-Regret Separation [0.0]
  Continual learning that is gradient-free, local, online, and append-only is attractive for edge and streaming deployment.<n>We give a provable account on recurring-regime streams.
  arXiv  Detail & Related papers  (2026-06-19T09:30:55Z)
• Non-asymptotic Tail Bounds for the Kostlan--Shub--Smale Field: Tensor PCA and Spherical $k$-Spin Complexity [0.6627152091494143]
  This paper builds a hierarchy of explicit, non-asymptotic tail bounds for the supremum of the Kostlan--Shub--Smale random field on the sphere.<n>It applies it to two problems: Spiked PCA and the landscape of the spherical $k$-spin model.
  arXiv  Detail & Related papers  (2026-06-16T08:27:25Z)
• A Mathematical Theory of Top-$k$ Sparse Attention via Total Variation Distance [7.014801584517052]
  We develop a unified framework certified Top-$k$ attention truncation that quantifies error at both the distribution and output levels.<n>We show that the total-variation distance coincides with the discarded softmax tail mass and satisfies $mathrmTV(P,hat P)=1-e-mathrmTV(P,hat P)=1-e-mathrmTV(P,hat P)$.
  arXiv  Detail & Related papers  (2025-12-08T15:36:41Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
  We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann. We show how our results have immediate applications to the modern theory of polarization.
  arXiv  Detail & Related papers  (2022-05-30T18:01:34Z)
• Stochastic behavior of outcome of Schur-Weyl duality measurement [45.41082277680607]
  We focus on the measurement defined by the decomposition based on Schur-Weyl duality on $n$ qubits. We derive various types of distribution including a kind of central limit when $n$ goes to infinity.
  arXiv  Detail & Related papers  (2021-04-26T15:03:08Z)
• The planted matching problem: Sharp threshold and infinite-order phase transition [25.41713098167692]
  We study the problem of reconstructing a perfect matching $M*$ hidden in a randomly weighted $ntimes n$ bipartite graph. We show that if $sqrtd B(mathcalP,mathcalQ) ge 1+epsilon$ for an arbitrarily small constant $epsilon>0$, the reconstruction error for any estimator is shown to be bounded away from $0$.
  arXiv  Detail & Related papers  (2021-03-17T00:59:33Z)
• Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals [49.60752558064027]
  We study the fundamental problems of agnostically learning halfspaces and ReLUs under Gaussian marginals. Our lower bounds provide strong evidence that current upper bounds for these tasks are essentially best possible.
  arXiv  Detail & Related papers  (2020-06-29T17:10:10Z)
• Curse of Dimensionality on Randomized Smoothing for Certifiable Robustness [151.67113334248464]
  We show that extending the smoothing technique to defend against other attack models can be challenging. We present experimental results on CIFAR to validate our theory.
  arXiv  Detail & Related papers  (2020-02-08T22:02:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.