Sudakov minoration asks whether a large family of separated random linear forms must have a large expected maximum. We present a proof candidate for this principle for all unconditional log-concave vectors. The argument starts with a classical reduction to sparse coordinate supports. It then selects one feasible threshold witness for each label, removes a common coordinate core, and controls the remaining overlaps. The main analytic step is an exponential-moment estimate for a softened witness payoff. We obtain it by combining a one-dimensional clipping inequality with triangular transport, using log-concavity of the source and sign symmetry of the target. A Bernoulli comparison restores the signs at the end. The exposition includes historical context, a guide to the proof, all intermediate arguments, and explicit choices of constants. Two consequences concern covering numbers in the moment metric and concentration of bounded functions of the magnitudes.
We prove the Sudakov minoration principle, with a universal constant, for unconditional log-concave random vectors whose coordinate magnitudes are negatively associated. The main step is a deterministic selection theorem: pairwise witnesses in convex downwardclosed sets yield, on an exponentially large subfamily, one f...
Let $Y_1,\ldots,Y_n$ be independent symmetric random variables with log-concave tails. We give a dimension-free characterization of the expected supremum of the canonical process $X_x=\sum_{i=1}^n x_iY_i$ without any $\Delta_2$ or regular-growth assumption on the coordinate tails. The characterization is governed by sc...
We prove a dimension-free Poincar\'e inequality for isotropic unconditional log-concave probability measures, establishing the Kannan-Lov\'asz-Simonovits (KLS) conjecture in the unconditional setting. The proof combines a new application of Dunkl operator theory combined with an appropriate transformation of the log-co...
We prove that an operator-norm separated family of matrices satisfies $\mathbb{E}\sup_{A\in T} G^{T}AG'\geq ca\log |T|$, where G,G'are independent standard Gaussian vectors and a is the separation. The main information estimate concerns arbitrary separated coisometries: conditional entropy is bounded by a source-depend...
We give an explicit extremal function for one step of gradient descent when the gradient error is bounded relative to the true gradient. The function is the sum of a quadratic in one coordinate and a Huber function in the other. It attains, for every admissible relative error level and every stepsize in the intermediat...
Jin-Ze Zhao· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.