Search Results for author:
Found 1 papers, 0 papers with code
Optimal Clustering with Noisy Queries via Multi-Armed Bandit
In particular, a new polynomial time algorithm with $O(\frac{n(k+\log n)}{\delta^2} + \text{poly}(k,\frac{1}{\delta}, \log n))$ queries is proposed.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
