arXiv (All)
open access
Efficient and Optimal Learning of Discrete Distributions with Person-Level Privacy
We study learning a discrete distribution under person-level differential privacy in the batched setting. Given $n$ users, each contributing $m$ i.i.d. samples from an unknown distribution $μ$ over $[k]$, we seek an estimate of $μ$ with total-variation error $α$. We give polynomial-time algorithms u
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Efficient and Optimal Learning of Discrete Distributions with Person-Level Privacy#1417751
- Spectral estimation for high-dimensional linear processes#1355894
- Universal Estimation of the Fisher Information for Processes with Memory#1084526
- Belief and Probability: A General Theory of Probability Cores#719797
- Stein Solution Factors via Mills Ratios: Affine Birth Rates and Symmetric Potential Distributions#1051873
Record · ID 1424745
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive