activity
20062022
most citedHadamard Response: Estimating Distributions Privately, Efficiently, and with Little Communication

97 citations · 543 across the 40 of their papers we have counts for

collaborators
Showing 2019Show all

7 papers · 1 filter

cs.IT2019★ 1 cited

Estimating Entropy of Distributions in Constant Space

Jayadev Acharya, Sourbh Bhadane, Piotr Indyk +1

We consider the task of estimating the entropy of -ary distributions from samples in the streaming model, where space is limited. Our main contribution is an algorithm that requ…

cs.LG2019★ 5 cited

Context-Aware Local Differential Privacy

Jayadev Acharya, Keith Bonawitz, Peter Kairouz +2

Local differential privacy (LDP) is a strong notion of privacy for individual users that often comes at the expense of a significant drop in utility. The classical definition of LD…

cs.LG2019★ 1 cited

Optimal multiclass overfitting by sequence reconstruction from Hamming queries

Jayadev Acharya, Ananda Theertha Suresh

A primary concern of excessive reuse of test datasets in machine learning is that it can lead to overfitting. Multiclass classification was recently shown to be more resistant to o…

cs.DS2019★ 2 cited

Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit

Jayadev Acharya, Clément L. Canonne, Yanjun Han +2

We study goodness-of-fit of discrete distributions in the distributed setting, where samples are divided between multiple users who can only release a limited amount of information…

cs.IT2019★ 27 cited

Communication Complexity in Locally Private Distribution Estimation and Heavy Hitters

Jayadev Acharya, Ziteng Sun

We consider the problems of distribution estimation and heavy hitter (frequency) estimation under privacy and communication constraints. While these constraints have been studied s…

cs.DS2019

Inference under Information Constraints II: Communication Constraints and Shared Randomness

Jayadev Acharya, Clément L. Canonne, Himanshu Tyagi

A central server needs to perform statistical inference based on samples that are distributed over multiple users who can each send a message of limited length to the center. We st…