Nearly tight worst-case bounds for Byzantine-robust centroid approximation under box and convex validity, with a new algorithm matching the convex lower bound.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Centroid Approximation for Byzantine-Tolerant Federated Learning
Nearly tight worst-case bounds for Byzantine-robust centroid approximation under box and convex validity, with a new algorithm matching the convex lower bound.