Search Results for author:
Found 2 papers, 0 papers with code
Properly Learning Decision Trees with Queries Is NP-Hard
We prove that it is NP-hard to properly PAC learn decision trees with queries, resolving a longstanding open problem in learning theory (Bshouty 1993; Guijarro-Lavin-Raghavan 1999; Mehta-Raghavan 2002; Feldman 2016).
Superpolynomial Lower Bounds for Decision Tree Learning and Testing
We establish new hardness results for decision tree optimization problems, adding to a line of work that dates back to Hyafil and Rivest in 1976.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
