Research map / Federated learning and privacy / Communication-efficient FL
Private and Communication-Efficient Algorithms for Entropy Estimation
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- INSPECTRE: Privately Estimating the Unseen (ICML 2018 · similarity 0.88)
- Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation (NeurIPS 2019 · similarity 0.88)
- Breaking the Bandwidth Barrier: Geometrical Adaptive Entropy Estimation (NeurIPS 2016 · similarity 0.87)
- Estimating Entropy of Distributions in Constant Space (NeurIPS 2019 · similarity 0.87)
- Lightweight Protocols for Distributed Private Quantile Estimation (ICML 2025 · similarity 0.87)
- Instance-Optimality for Private KL Distribution Estimation (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.