A Two-regime Khintchine Inequality and an Improved Bound on the Degree-1 Fourier Weight for Linear Threshold Functions
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 weight vector has unit norm, this lower bound is a constant, with equality attained only for a simple family of extremal configurations. A refined version due to De, Diakonikolas, and Servedio (2013) -- referred to as the \emph{linear Khintchine inequality} -- strengthens this by establishing a lower bound that depends linearly on the distance of the weight 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 W≤ 1[LTF] ≥ 0.53317, marking progress towards a conjecture of O'Donnell.
Related
- Fourier entropy of threshold functions and their compositions
- A Khintchine type inequality for non-independent random variables
- A Sharp Small-Coefficient Variant of Khintchine's Inequality and the Sharp π/2 Theorem
- Certified Fourier rounding for the real Grothendieck inequality
- The Lorentz Threshold in Fourier Restriction
BibTeX
@misc{fang2026tworegime,
title = {{A Two-regime Khintchine Inequality and an Improved Bound on the Degree-1 Fourier Weight for Linear Threshold Functions}},
author = {Xuan Fang and Tianyu Wang},
howpublished = {arXiv},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.27908},
eprint = {2608.27908},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.27908},
}
RIS
TY - UNPB
TI - A Two-regime Khintchine Inequality and an Improved Bound on the Degree-1 Fourier Weight for Linear Threshold Functions
AU - Xuan Fang
AU - Tianyu Wang
PY - 2026
DA - 2026/08/28
PB - arXiv
DO - 10.48550/arxiv.2608.27908
UR - https://arxiv.org/abs/2608.27908
AB - 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 weight vector has unit norm, this lower bound is a constant, with equality attained only for a simple family of extremal configurations. A refined version due to De, Diakonikolas, and Servedio (2013) -- referred to as the \emph{linear Khintchine inequality} -- strengthens this by establishing a lower bound that depends linearly on the distance of the weight 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 W^≤ 1[LTF] ≥ 0.53317, marking progress towards a conjecture of O'Donnell.
ER -