Local L1-regularized robust estimators plus server-side robust aggregation achieve near-optimal rates for high-dimensional sparse learning under Byzantine attacks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Byzantine-Robust Distributed Sparse Learning Revisited
Local L1-regularized robust estimators plus server-side robust aggregation achieve near-optimal rates for high-dimensional sparse learning under Byzantine attacks.