Privacy-Aware Sequential Learning
Yuxin Liu, M. Amin Rahimian

TL;DR
This paper explores how privacy-preserving strategies in sequential learning can surprisingly accelerate information aggregation, balancing privacy and accuracy, especially with continuous signals and heterogeneous populations.
Contribution
It introduces an optimal randomization strategy that enhances learning speed under privacy constraints, contrasting with traditional nonprivate models.
Findings
Privacy-preserving noise accelerates learning to logarithmic time.
Under privacy, the expected time to correct actions becomes finite.
Heterogeneous populations can achieve near-optimal learning rates with some low-privacy agents.
Abstract
In settings like vaccination registries, individuals act after observing others, and the resulting public records can expose private information. We study privacy-preserving sequential learning, where agents add endogenous noise to their reported actions to conceal private signals. Efficient social learning relies on information flow, seemingly in conflict with privacy. Surprisingly, with continuous signals and a fixed privacy budget , the optimal randomization strategy balances privacy and accuracy, accelerating learning to , faster than the nonprivate rate. In the nonprivate baseline, the expected time to the first correct action and the number of incorrect actions diverge; under privacy with sufficiently small , both are finite. Privacy helps because, under the false state, agents more often receive signals…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
