research
∙
07/09/2023
Properly Learning Decision Trees with Queries Is NP-Hard
We prove that it is NP-hard to properly PAC learn decision trees with qu...
share
research
∙
07/08/2023
A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers
We prove a strong composition theorem for junta complexity and show how ...
research
∙
11/04/2022
Certification with an NP Oracle
In the certification problem, the algorithm is given a function f with c...
research
∙
10/12/2022
Superpolynomial Lower Bounds for Decision Tree Learning and Testing
We establish new hardness results for decision tree optimization problem...
research
∙
07/14/2022
A Query-Optimal Algorithm for Finding Counterfactuals
We design an algorithm for finding counterfactuals with strong theoretic...
research
∙
01/19/2022
The Query Complexity of Certification
We study the problem of certification: given queries to a function f : {...
research
∙
07/28/2017
