REVIEW 3 cited by
Bernstein-like Concentration and Moment Inequalities for Polynomials of Independent Random Variables: Multilinear Case
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We show that the probability that a multilinear polynomial $f$ of independent random variables exceeds its mean by $\lambda$ is at most $e^{-\lambda^2 / (R^q Var(f))}$ for sufficiently small $\lambda$, where $R$ is an absolute constant. This matches (up to constants in the exponent) what one would expect from the central limit theorem. Our methods handle a variety of types of random variables including Gaussian, Boolean, exponential, and Poisson. Previous work by Kim-Vu and Schudy-Sviridenko gave bounds of the same form that involved less natural parameters in place of the variance.
Forward citations
Cited by 3 Pith papers
-
Sparsity-adaptive concentration inequalities for random polynomials
Establishes sparsity-adaptive L_r-moment bounds for centered polynomials of degree at most D in independent sparse α-sub-exponential variables via partition norms of sparsity-weighted expected derivative tensors, reco...
-
Inference for Balance in Dynamic Signed Networks
Nonparametric inference for structural balance in dynamic signed networks via time-varying graphon model, kernel smoothing, and Edgeworth expansion for studentized statistics.
-
Simple Norm Bounds for Polynomial Random Matrices via Decoupling
A decoupling-based recursion bounds polynomial random matrix moments by deterministic derivative matrices, recovering several known spectral norm bounds with an elementary proof.
Discussion (0). Continue with ORCID to comment.