Preprint in the OpenAI Math release
Average sensitivity of polynomial threshold functions
OpenAI
Abstract
For every n ≥ 1 and , we prove that a polynomial threshold function of degree at most d on the uniform Boolean cube has average sensitivity at most . This proves the asymptotic form of the Gotsman–Linial conjecture. The bound is uniform in both parameters and uses the convention .
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.