Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleNovember 2022
Properly Learning Decision Trees in almost Polynomial Time
Journal of the ACM (JACM), Volume 69, Issue 6Article No.: 39, Pages 1–19https://doi.org/10.1145/3561047We give an nO(log log n)-time membership query algorithm for properly and agnostically learning decision trees under the uniform distribution over { ± 1}n. Even in the realizable setting, the previous fastest runtime was nO(log n), a consequence of a ...
- ArticleMay 2006
Hardness of approximate two-level logic minimization and PAC learning with membership queries
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of ComputingPages 363–372https://doi.org/10.1145/1132516.1132569Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider two standard variants of this problem. The first one is two-level logic ...
- articleSeptember 1996
How many queries are needed to learn?
We investigate the query complexity of exact learning in the membership and (proper) equivalence query model. We give a complete characterization of concept classes that are learnable with a polynomial number of polynomial sized queries in this model. ...
