Selected Publications

Computational-statistical tradeoffs from NP-hardness

The sample complexity of smooth boosting and the tightness of the hardcore theorem

Fast decision tree learning solves hard coding-theoretic problems

A strong direct sum theorem for distributional query complexity

Properly learning decision trees with queries is NP-hard

A strong composition theorem for junta complexity and the boosting of property testers

Lifting uniform learners via distributional decomposition

Properly learning decision trees in almost polynomial time

Fooling polytopes

Settling the query complexity of non-adaptive junta testing

Poly-logarithmic Frege depth lower bounds via an expander switching lemma

An average-case depth hierarchy theorem for Boolean circuits