REVIEW 8 cited by
An error bound in the Sudakov-Fernique inequality
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
Signed reviews
read the original abstract
We obtain an asymptotically sharp error bound in the classical Sudakov-Fernique comparison inequality for finite collections of gaussian random variables. Our proof is short and self-contained, and gives an easy alternative argument for the classical inequality, extended to the case of non-centered processes.
Forward citations
Cited by 8 Pith papers
-
Testing Unate Distributions
Unate distributions require θ̃(n^{3/2}) samples for uniformity testing and allow Õ(n^{3/2}) conditional samples for unateness testing in the subcube model.
-
Gaussian Convexity Principles for Sharp Moderate Deviations of Gaussian Maxima and Critical SK Free Energy Variance
Sharp moderate-deviation exponent κ²/(2−α²) for Gaussian maxima above the expected maximum, plus an entropy/I-MMSE/information-percolation proof of the critical SK variance (1/6)log N.
-
Gaussian comparison above the median
A centered Gaussian with smaller covariance assigns at least as much probability as one with larger covariance to any closed convex set with reference probability at least 1/2.
-
Stochastic Sensitivity Analysis for Matched Observational Studies
Stochastic sensitivity analysis for matched studies finds worst-case conditional laws for hidden confounders instead of worst-case realizations, controlled by a sensitivity parameter that permits imperfect alignment w...
-
The Structure of Extremal Bad Science Matrices
For unit-row matrices, the maximal average sup-norm over Rademacher vectors is sqrt(2 log(2n)) - log log(2n)/(2 sqrt(2 log(2n))) + o(1/sqrt(log n)) for explicit Hadamard-based matrices and random sign matrices, with e...
-
An extension of a theorem of Chevet
Chevet's inequality on E[(P_{H^perp}(max X_i))^2] extends to functions f satisfying five structural conditions, and the regular simplex maximizes the new functionals in a special block case.
-
Gaussian Multiplier Bootstrap Procedure for the $k$th Largest Coordinate of High-Dimensional Statistics
Provides Gaussian multiplier bootstrap approximation error bounds for the kth largest coordinate of high-dimensional statistics, valid when dimension exceeds sample size.
-
The discrepancy in min-max statistics between two random matrices with finite third moments
A coupling inequality bounds the discrepancy between min-max statistics of two independent random matrices under finite third moments, extending the Gaussian Gordon-type inequalities.
Discussion (0). Continue with ORCID to comment.