Author of the publication

A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions.

, , , and . CCC, page 211-222. IEEE Computer Society, (2010)

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

LP decoding corrects a constant fraction of errors., , , , and . ISIT, page 68. IEEE, (2004)Learning and Lower Bounds for AC0 with Threshold Gates., and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 588-601. Springer, (2010)Learning Circuits with few Negations., , , , and . APPROX-RANDOM, volume 40 of LIPIcs, page 512-527. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Testing noisy linear functions for sparsity., , and . STOC, page 610-623. ACM, (2020)DNF Are Teachable in the Average Case., , and . COLT, volume 4005 of Lecture Notes in Computer Science, page 214-228. Springer, (2006)One-Pass Boosting., , and . NIPS, page 73-80. Curran Associates, Inc., (2007)A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions., , , and . CCC, page 211-222. IEEE Computer Society, (2010)Distribution-free Junta Testing., , , , and . ACM Trans. Algorithms, 15 (1): 1:1-1:23 (2019)Learning DNF from random walks., , , and . J. Comput. Syst. Sci., 71 (3): 250-265 (2005)Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions., , and . Electron. Colloquium Comput. Complex., (2013)