Research map / Learning theory and algorithms / Sample complexity
New Bounds For Distributed Mean Estimation and Variance Reduction
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
- Distributed Mean Estimation with Limited Communication (ICML 2017 · similarity 0.90)
- Optimal Sparsity-Sensitive Bounds for Distributed Mean Estimation (NeurIPS 2019 · similarity 0.89)
- Correlated Quantization for Distributed Mean Estimation and Optimization (ICML 2022 · similarity 0.88)
- Decentralized Non-convex Stochastic Optimization with Heterogeneous Variance (AAAI 2026 · similarity 0.88)
- Correlation Aware Sparsified Mean Estimation Using Random Projection (NeurIPS 2023 · similarity 0.87)
- Accelerating Federated Learning with Quick Distributed Mean Estimation (ICML 2024 · similarity 0.87)
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.