Search Results for author:
Found 1 papers, 0 papers with code
Efficient Quantum Agnostic Improper Learning of Decision Trees
Our algorithm is the first algorithm (classical or quantum) for learning decision trees in polynomial time without membership queries.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
