Jon Kleinberg

Learning Distributions from Multiple Data Providers

H hierarchical comparability is identified as a sufficient structural condition on $\mathscr S$ under which the optimal complexity is nearly linear, $\widetilde \Theta(n/\epsilon^2)$, with pairwise query families as a canonical example.