Learning Partitions with Optimal Query and Round Complexities

We consider the basic problem of learning an unknown partition of n elements into at most k sets using simple queries that reveal information about a small subset of elements. Our starting point is the well-studied pairwise same-set queries which ask if a pair of elements belong to the same class. It is known that non-adaptive algorithms require Theta(n2) queries, while adaptive algorithms require Theta(nk) queries, and the best known algorithm uses k-1 rounds. This problem has been studied extensively over the last two decades in multiple communities due to its fundamental nature and relevance to clustering, active learning, and crowd sourcing. In many applications, it is of high interest to reduce adaptivity while minimizing query complexity. We give a complete characterization of the deterministic query complexity of this problem as a function of the number of rounds, r, interpolating between the non-adaptive and adaptive settings: for any constant r, the query complexity is Theta(n^1+frac12r-1k^1-frac12r-1). Our algorithm only needs O(log log n) rounds to attain the optimal O(nk) query complexity. Next, we consider two generalizations of pairwise queries to subsets S of size at most s: (1) weak subset queries which return the number of classes intersected by S, and (2) strong subset queries which return the entire partition restricted on S. Once again in crowd sourcing applications, queries on large sets may be prohibitive. For non-adaptive algorithms, we show Omega(n2/s2) strong queries are needed. Perhaps surprisingly, we show that there is a non-adaptive algorithm using weak queries that matches this bound up to log-factors for all s ≤ √n. More generally, we obtain nearly matching upper and lower bounds for algorithms using subset queries in terms of both the number of rounds, r, and the query size bound, s.