惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

爱范儿
爱范儿
WordPress大学
WordPress大学
C
Check Point Blog
GbyAI
GbyAI
U
Unit 42
Google DeepMind News
Google DeepMind News
B
Blog RSS Feed
Blog — PlanetScale
Blog — PlanetScale
J
Java Code Geeks
I
InfoQ
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Hugging Face - Blog
Hugging Face - Blog
Vercel News
Vercel News
博客园 - 【当耐特】
美团技术团队
小众软件
小众软件
S
SegmentFault 最新的问题
Jina AI
Jina AI
阮一峰的网络日志
阮一峰的网络日志
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
The Cloudflare Blog
Last Week in AI
Last Week in AI
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
V
Visual Studio Blog

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Explicit Universal Bounds for Cumulants via Moments
Jiechen Zhang · 2025-10-07 · via math.ST updates on arXiv.org

We establish explicit, universal, and distribution-free bounds for the $n$-th cumulant, $κ_n(X)$, of a scalar random variable, controlled solely by an $n$-th order absolute moment functional $M_n(X)$. The bounds take the form $\lvertκ_n(X)\rvert \le C_n M_n(X)$. Our principal contribution is the derivation of coefficients satisfying $C_n \sim (n-1)!/ρ^{\,n}$, which offers an exponential improvement over classical bounds where the coefficients grow superexponentially (on the order of $n^n$). We present a hierarchy of refinements where the rate parameter $ρ$ increases as the functional $M_n(X)$ incorporates more structural information. The most general bound uses the raw moment $M_n(X)=\mathsf{E}[\lvert X\rvert^n]$ with rate $ρ=\ln 2 \approx 0.693$. Using the central moment $M_n(X)=\mathsf{E}[\lvert X-\mathsf{E}[X]\rvert^n]$ improves the rate to $ρ_{\mathrm{cen}} \approx 1.146$, while assuming symmetry yields even higher rates. The proof is elementary, combining the moment-cumulant partition formula with a uniform moment-product inequality. We further prove that while these bounds are not attainable whenever the relevant coefficient is positive, they are asymptotically efficient given the limited information of a single moment. The utility of the bounds is demonstrated through an application to standardized cumulants of independent sums.