The Boolean surface area of polynomial threshold functions
Abstract
Polynomial threshold functions (PTFs) are an important low-complexity class of Boolean functions, with strong connections to learning theory and approximation theory. Recent work on learning and testing PTFs has exploited structural and isoperimetric properties of the class, especially bounds on average sensitivity, one of the central themes in the study of PTFs since the Gotsman--Linial conjecture. In this work we study PTFs through the lens of the Boolean surface area (or Talagrand boundary) \[ BSA[f]=E|∇ f|=Esf(x), \] a natural measure of vertex-boundary complexity on the discrete cube. Our main result is that every degree-d PTF has polylogarithmic Boolean surface area: \[ BSA[f] Cd((en))Cd. \] The proof is based on the PTF Restriction Lemma of Kabanets, Kane, and Lu KKL2017 and proceeds through a tail bound for the pointwise sensitivity. In particular, it controls all subcritical fractional moments of the sensitivity. We also record a random block partition principle for Boolean surface area and an alternative recursive argument following Kane's work DK on average sensitivity, which independently yields the weaker bound \[ BSA[f] (Cd n). \]