mlsanityData to 14 Oct 2026

Continual Mean Estimation Under User-Level Privacy

arXiv 2212.09980 ↗First posted 20 Dec 2022cs.LG cs.CRcited by 5

Not on the map. Why?

Abstract (arXiv)

We consider the problem of continually releasing an estimate of the population mean of a stream of samples that is user-level differentially private (DP). At each time instant, a user contributes a sample, and the users can arrive in arbitrary order. Until now these requirements of continual release and user-level privacy were considered in isolation. But, in practice, both these requirements come together as the users often contribute data repeatedly and multiple queries are made. We provide an algorithm that outputs a mean estimate at every time instant t such that the overall release is user-level varepsilon-DP and has the following error guarantee: Denoting by Mt the maximum number of samples contributed by a user, as long as tildeOmega(1/varepsilon) users have Mt/2 samples each, the error at time t is tildeO(1/√t+√Mt/tvarepsilon). This is a universal error guarantee which is valid for all arrival patterns of the users. Furthermore, it (almost) matches the existing lower bounds for the single-release setting at all time instants when users have contributed equal number of samples.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 30 of its 51 references that are in the map. First posted on arXiv 20 Dec 2022.

Builds on

30 of 51 references.

References · 30

  1. 2017Collecting Telemetry Data Privatelycited by 149
  2. 2016Minimax Optimal Procedures for Locally Private Estimationcited by 107
  3. 2018Privately Learning High-Dimensional Distributionscited by 104
  4. 2020CoinPress: Practical Private Mean and Covariance Estimationcited by 74
  5. 2020Private Mean Estimation of Heavy-Tailed Distributionscited by 73
  6. 2021Learning with User-Level Privacycited by 72
  7. 2019Private Hypothesis Selectioncited by 60
  8. 2019Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimationcited by 52
  9. 2020Learning discrete distributions: user vs item-level privacycited by 41
  10. 2021The Price of Differential Privacy under Continual Observationcited by 34
  11. 2018Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraintscited by 33
  12. 2018Inference under Information Constraints I: Lower Bounds from Chi-Square Contractioncited by 31
18 more
  1. 2020A Primer on Private Statisticscited by 30
  2. 2017Generalization for Adaptively-chosen Estimators via Stable Mediancited by 26
  3. 2018Hadamard Response: Estimating Distributions Privately, Efficiently, and with Little Communicationcited by 26
  4. 2021Tight and Robust Private Mean Estimation with Few Userscited by 26
  5. 2019Inference under Information Constraints II: Communication Constraints and Shared Randomnesscited by 22
  6. 2020Fisher information under local differential privacycited by 22
  7. 2020Distributed Gaussian Mean Estimation under Communication Constraints: Optimal Rates and Communication-Efficient Algorithmscited by 17
  8. 2022Discrete Distribution Estimation under User-level Local Differential Privacycited by 17
  9. 2020Interactive Inference under Information Constraintscited by 15
  10. 2019Local differential privacy: Elbow effect in optimal density estimation and adaptation over Besov ellipsoidscited by 13
  11. 2021Inference under Information Constraints III: Local Privacy Constraintscited by 13
  12. 2019Mean Estimation from One-Bit Measurementscited by 9
  13. 2021Optimal Rates for Nonparametric Density Estimation under Communication Constraintscited by 9
  14. 2021User-Level Private Learning via Correlated Samplingcited by 9
  15. 2018Local Differential Privacy for Evolving Datacited by 6
  16. 2020Optimal distributed composite testing in high-dimensional Gaussian models with 1-bit communicationcited by 4
  17. 2018Private Continual Release of Real-Valued Data Streamscited by 3
  18. 2013Identifying Participants in the Personal Genome Project by Name (A Re-identification Experiment)cited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 2; 2025: 0; 2026: 1.

5 papers.