Search Results for author:
Found 3 papers, 0 papers with code
Active Learning with Simple Questions
We measure the complexity of the region queries via the VC dimension of the family of regions.
Buying Information for Stochastic Optimization
In this paper, we study how to buy information for stochastic optimization and formulate this question as an online learning problem.
Clustering with Queries under Semi-Random Noise
Our main result is a computationally efficient algorithm that can identify large clusters with $O\left(\frac{nk \log n} {(1-2p)^2}\right) + \text{poly}\left(\log n, k, \frac{1}{1-2p} \right)$ queries, matching the guarantees of the best known algorithms in the fully-random model.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
