Paperlane

no. 7 · Tuesday 3 November 2026

A Two-regime Khintchine Inequality and an Improved Bound on the Degree-1 Fourier Weight for Linear Threshold Functions

Xuan Fang and Tianyu Wang

math.PR · v2

Abstract

The Khintchine inequality provides a lower bound on the expected absolute value of a weighted sum of independent Rademacher random variables. In the classical setting, when the coefficient vector has unit Euclidean norm, this lower bound is a constant, with equality attained only by a simple family of extremal configurations. A refinement due to De, Diakonikolas, and Servedio, referred to as the \emph{linear Khintchine inequality} in this work, strengthens this estimate by establishing a lower bound that depends linearly on the distance of the coefficient vector from the extremal set. In this paper, we present a refined analysis of this dependence on the weight vector. Our results reveal a phase transition in the rate of improvement: when the dimension exceeds six, the lower bound undergoes an abrupt change as the weight vector deviates from the minimizer. Additionally, we improve the slope constant in linear Khintchine inequality. As a consequence, we establish an improved lower bound on the degree-1 Fourier weight for linear threshold functions $\mathbf W^{\leq1}[f]\geq0.55100929$, marking progress towards a conjecture of Benjamini, Kalai, and Schramm.

fields
Probability, Combinatorics
pdf ↗ page arXiv:2608.27908 ↗