Byzantine-Robust Distributed Sparse Learning Revisited
About
We revisit Byzantine robust distributed estimation for high-dimensional sparse linear models. By combining local $\ell_1$-regularized robust estimation with robust aggregation at the server, the framework applies to pseudo-Huber regression, quantile regression, and sparse SVM. We show that the resulting estimators yield non-asymptotic guarantees and attain near-optimal statistical rates under mild conditions, while remaining communication-efficient. Simulations confirm strong robustness in estimation, support recovery and classification accuracy under various Byzantine attacks.
Yuxuan Wang, Lixin Zhang, Kangqiang Li• 2026
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Classification | Model 1 | Accuracy0.9294 | 27 | |
| Quantile Regression | Synthetic Gaussian noise, n=300, m=25, d=500, alpha=0.2 (test) | Error0.4973 | 11 | |
| Sparse Regression | Pseudo-Huber Regression Gaussian noise, alpha=0, n=200, m=50, d=500 (simulation) | Error16.43 | 6 | |
| Pseudo-Huber Regression | Pseudo-Huber Regression with Cauchy noise alpha=0, n=500, m=20, d=500 synthetic | Error0.2216 | 5 |
Showing 4 of 4 rows