DRSGD-ByMI identifies Byzantine machines via sample-splitting score statistics with FDR control, then prunes them to recover sufficient connectivity and achieve order-optimal convergence rates identical to standard decentralized SGD.
Byzantine-robust decentralized stochastic optimization with stochastic gradient noise-independent learning error
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ME 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Toward Exact Convergence in Byzantine-Robust Decentralized Learning: A Statistical Identification Approach
DRSGD-ByMI identifies Byzantine machines via sample-splitting score statistics with FDR control, then prunes them to recover sufficient connectivity and achieve order-optimal convergence rates identical to standard decentralized SGD.