Author of the publication

Average sensitivity and noise sensitivity of polynomial threshold functions

, , , and . (2009)cite arxiv:0909.5011Comment: added proofs for non-multilinear PTFs over Gaussian random variables, added discussion section.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

PAC Analogues of Perceptron and Winnow via Boosting the Margin.. COLT, page 148-157. Morgan Kaufmann, (2000)A regularity lemma, and low-weight approximators, for low-degree polynomial threshold functions, , , and . CoRR, (2009)Equivalences and Separations Between Quantum and Classical Learnability., and . SIAM J. Comput., 33 (5): 1067-1092 (2004)Maximum Margin Algorithms with Boolean Kernels., and . COLT, volume 2777 of Lecture Notes in Computer Science, page 87-101. Springer, (2003)Tight Bounds on Proper Equivalence Query Learning of DNF., , , and . COLT, volume 23 of JMLR Proceedings, page 31.1-31.18. JMLR.org, (2012)Learning Unions of omega(1)-Dimensional Rectangles., and . ALT, volume 4264 of Lecture Notes in Computer Science, page 32-47. Springer, (2006)Editors' Introduction., , and . ALT, volume 4754 of Lecture Notes in Computer Science, page 1-8. Springer, (2007)On PAC Learning Algorithms for Rich Boolean Function Classes.. TAMC, volume 3959 of Lecture Notes in Computer Science, page 442-451. Springer, (2006)Testing monotone high-dimensional distributions., and . STOC, page 147-156. ACM, (2005)Learning DNF from random walks., , , and . J. Comput. Syst. Sci., 71 (3): 250-265 (2005)