Every degree-at-most-d real polynomial threshold function on the uniform n-dimensional Boolean cube has average sensitivity at most 8d√n for 1≤d≤n.
Every degree-at-most-d real polynomial threshold function on the uniform n-dimensional Boolean cube has average sensitivity at most 8d√n for 1≤d≤n.
Every degree-at-most-d real polynomial threshold function on the uniform n-dimensional Boolean cube has average sensitivity at most 8d√n for 1≤d≤n.
If correct, proves the asymptotic Gotsman–Linial sensitivity bound uniformly in degree and dimension.
Is average sensitivity of degree-d polynomial threshold functions O(d√n)?
Publication dates and editorial changes.
OpenAI reports the asymptotic average-sensitivity bound for polynomial thresholds
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
