Communication-Efficient Agnostic Federated Learning via Faster Convergence and Compression
cs.LG
Submitted: 2026-09-29
Updated: 2026-09-29
Terminology
Sources
- Group Distributionally Robust Optimization with Flexible Sample Queries
- LEAF: A Benchmark for Federated Settings
- Adaptive and Efficient Algorithms for Tracking the Best Expert
- Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
- Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms
- Scaff-PD: Communication Efficient Fair and Robust Federated Learning
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks