Simple and Fast Algorithms for Interactive Machine Learning with Random Counter-examples

no code implementations • 1 Oct 2018 • Jagdeep Bhatia

We show that both of these algorithms have an $\mathcal{O}(\log{}|H|)$ asymptotically optimal average learning time.

BIG-bench Machine Learning Clustering +1