Metraipolis › archive › dc_23f92e8a9402

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27908
License (as archived)
CC0-1.0
Archived
2026-10-17T11:18:03.363Z
SHA-256 of the archived text
f759b2e2e3a9126af44d0dd7625fc943fcadbe49db100d1756cfd40d5602f90c
Stable URL of this page
https://metraipolis.com/documento/dc_23f92e8a9402

How to cite

A Two-regime Khintchine Inequality and an Improved Bound on the Degree-1 Fourier Weight for Linear Threshold Functions — arXiv:2608.27908 — arXiv (en), https://arxiv.org/abs/2608.27908 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_23f92e8a9402 (Metraipolis archive dc_23f92e8a9402, sha256 f759b2e2e3a9126af44d0dd7625fc943fcadbe49db100d1756cfd40d5602f90c)
BibTeX
@misc{dc23f92e8a9402,
  title = {A Two-regime Khintchine Inequality and an Improved Bound on the Degree-1 Fourier Weight for Linear Threshold Functions — arXiv:2608.27908},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27908},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_23f92e8a9402; sha256 f759b2e2e3a9126af44d0dd7625fc943fcadbe49db100d1756cfd40d5602f90c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27908. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\mathbf{W}^{\leq 1}[\mathrm{LTF}] \geq 0.53317$, marking progress towards a conjecture of O'Donnell.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.PR).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.27908 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T11:05:49.679Z dalla pagina https://arxiv.org/catchup/math.PR/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).