activity
20072026
most citedDifferentially Private Contextual Linear Bandits

51 citations · 160 across the 19 of their papers we have counts for

collaborators
Showing 2012Show all

6 papers · 1 filter

cs.CR2012

Differentially Private Data Analysis of Social Networks via Restricted Sensitivity

Jeremiah Blocki, Avrim Blum, Anupam Datta +1

We introduce the notion of restricted sensitivity as an alternative to global and smooth sensitivity to improve accuracy in differentially private data analysis. The definition of…

cs.LG2012★ 5 cited

Predicting Preference Flips in Commerce Search

Or Sheffet, Nina Mishra, Samuel Ieong

Traditional approaches to ranking in web search follow the paradigm of rank-by-score: a learned function gives each query-URL combination an absolute score and URLs are ranked acco…

cs.LG2012★ 23 cited

Improved Spectral-Norm Bounds for Clustering

Pranjal Awasthi, Or Sheffet

Aiming to unify known results about clustering mixtures of distributions under separation conditions, Kumar and Kannan[2010] introduced a deterministic condition for clustering dat…

cs.DS2012

Additive Approximation for Near-Perfect Phylogeny Construction

Pranjal Awasthi, Avrim Blum, Jamie Morgenstern +1

We study the problem of constructing phylogenetic trees for a given set of species. The problem is formulated as that of finding a minimum Steiner tree on points over the Boole…

cs.DS2012★ 1 cited

The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy

Jeremiah Blocki, Avrim Blum, Anupam Datta +1

This paper proves that an "old dog", namely -- the classical Johnson-Lindenstrauss transform, "performs new tricks" -- it gives a novel way of preserving differential privacy. We s…

cs.GT2012★ 22 cited

Send Mixed Signals -- Earn More, Work Less

Peter Bro Miltersen, Or Sheffet

Emek et al. presented a model of probabilistic single-item second price auctions where an auctioneer who is informed about the type of an item for sale, broadcasts a signal about t…