Online Distribution Learning with Local Private Constraints
Not on the map. Why?
Abstract (arXiv)
We study the problem of online conditional distribution estimation with unbounded label sets under local differential privacy. Let F be a distribution-valued function class with unbounded label set. We aim at estimating an unknown function f∈ F in an online fashion so that at time t when the context boldsymbolxt is provided we can generate an estimate of f(boldsymbolxt) under KL-divergence knowing only a privatized version of the true labels sampling from f(boldsymbolxt). The ultimate objective is to minimize the cumulative KL-risk of a finite horizon T. We show that under (ε,0)-local differential privacy of the privatized labels, the KL-risk grows as tildeTheta(frac1ε√KT) upto poly-logarithmic factors where K=|F|. This is in stark contrast to the tildeTheta(√Tlog K) bound demonstrated by Wu et al. (2023a) for bounded label sets. As a byproduct, our results recover a nearly tight upper bound for the hypothesis selection problem of gopi et al. (2020) established only for the batch setting.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 26 references that are in the map. First posted on arXiv 1 Feb 2024.
Builds on
13 of 26 references.
References · 13
- 2021The Statistical Complexity of Interactive Decision Makingcited by 208
- 2021Deep Learning with Label Differential Privacycited by 113
- 2019The Power of Factorization Mechanisms in Local and Central Differential Privacycited by 30
- 2021Label differential privacy via clusteringcited by 20
- 2020Locally Private Hypothesis Selectioncited by 17
- 2022Private Online Prediction from Experts: Separations and Faster Ratescited by 17
- 2022Expected Worst Case Regret via Stochastic Sequential Coveringcited by 12
- 2015Sequential Probability Assignment with Binary Alphabets and Large Classes of Expertscited by 11
- 2021Littlestone Classes are Privately Online Learnablecited by 10
- 2022Does Label Differential Privacy Prevent Label Inference Attacks?cited by 10
- 2020Relaxing the I.I.D. Assumption: Adaptively Minimax Optimal Regret via Root-Entropic Regularizationcited by 8
- 2023Smoothed Analysis of Sequential Probability Assignmentcited by 7
1 more
- 2023On Differentially Private Online Predictionscited by 3
Built on by
Not cited yet.