4 citations · 6 across the 9 of their papers we have counts for
5 papers · 1 filter
Pan-Private Uniformity Testing
Kareem Amin, Matthew Joseph, Jieming Mao
A centrally differentially private algorithm maps raw data to differentially private outputs. In contrast, a locally differentially private algorithm may only access data through p…
Sorted Top-k in Rounds
Mark Braverman, Jieming Mao, Yuval Peres
We consider the sorted top- problem whose goal is to recover the top- items with the correct order out of items using pairwise comparisons. In many applications, multiple…
A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model
Xi Chen, Yuanzhi Li, Jieming Mao
We study the active learning problem of top- ranking from multi-wise comparisons under the popular multinomial logit model. Our goal is to identify the top- items with high p…
Competitive analysis of the top-K ranking problem
Xi Chen, Sivakanth Gopi, Jieming Mao +1
Motivated by applications in recommender systems, web search, social choice and crowdsourcing, we consider the problem of identifying the set of top items from noisy pairwise c…
Parallel Algorithms for Select and Partition with Noisy Comparisons
Mark Braverman, Jieming Mao, S. Matthew Weinberg
We consider the problem of finding the highest element in a totally ordered set of elements (select), and partitioning a totally ordered set into the top and botto…