Research map / Learning theory and algorithms / Sample complexity
Robust Distributed Learning: Tight Error Bounds and Breakdown Point under Data Heterogeneity
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
- Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates (ICML 2018 · similarity 0.88)
- Tight Stability Bounds for Robust Distributed Learning: Byzantine Failures Hurt Generalization More than Data Poisoning (ICML 2026 · similarity 0.88)
- Distributed Training with Heterogeneous Data: Bridging Median- and Mean-Based Algorithms (NeurIPS 2020 · similarity 0.88)
- Robust Distributed Gradient Aggregation Using Projections onto Gradient Manifolds (AAAI 2024 · similarity 0.87)
- Feature Averaging: An Implicit Bias of Gradient Descent Leading to Non-Robustness in Neural Networks (ICLR 2025 · similarity 0.86)
- From Inexact Gradients to Byzantine Robustness: Acceleration and Optimization under Similarity (NeurIPS 2026 · 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.