Introduces MEB and c-MEB validity conditions for Byzantine-robust aggregation, proving achievability under majority honesty (n>2t) with an optimal MinMax-MEB rule at c<sqrt(2) and explicit guarantees for standard aggregators.
Multidimensional agreement in byzantine systems.Distributed Computing, 28(6):423–441, 2015
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Optimal round complexity and resilience approximate agreement on trees with matching lower bounds, extended to block graphs in synchronous and asynchronous models.
citing papers explorer
-
Practical Validity Conditions for Byzantine-Tolerant Federated Learning
Introduces MEB and c-MEB validity conditions for Byzantine-robust aggregation, proving achievability under majority honesty (n>2t) with an optimal MinMax-MEB rule at c<sqrt(2) and explicit guarantees for standard aggregators.
-
Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
Optimal round complexity and resilience approximate agreement on trees with matching lower bounds, extended to block graphs in synchronous and asynchronous models.