Pages that link to "Item:Q2875180"

The following pages link to Bounding the average sensitivity and noise sensitivity of polynomial threshold functions (Q2875180):

Displaying 11 items.

• The average sensitivity of an intersection of half spaces (Q347457) (← links)
• The correct exponent for the Gotsman-Linial conjecture (Q488047) (← links)
• The Gaussian surface area and noise sensitivity of degree-\(d\) polynomial threshold functions (Q645127) (← links)
• A polynomial-time algorithm for learning noisy linear threshold functions (Q1271190) (← links)
• A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting (Q1656545) (← links)
• Polynomial regression under arbitrary product distributions (Q1959600) (← links)
• A structure theorem for poorly anticoncentrated polynomials of Gaussians and applications to the study of polynomial threshold functions (Q2012247) (← links)
• Approximating the Influence of Monotone Boolean Functions in $O(\sqrt{n})$ Query Complexity (Q3088135) (← links)
• Bounding the sensitivity of polynomial threshold functions (Q3191612) (← links)
• On the noise sensitivity of monotone functions (Q4431436) (← links)
• Concentration and Moment Inequalities for Polynomials of Independent Random Variables (Q5743410) (← links)