Efficient Byzantine-robust distributed inference with regularization: a trade-off between compression and adversary

DOI10.1016/J.INS.2024.121010MaRDI QIDQ6571196zbMATH OpenFDO

Authors Xingcai Zhou, Guang Yang, Le Chang, Shao-Gao Lv

Publication date 11 July 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2024.121010

zbMATH Keywords

adversaryByzantine-robustcommunication-efficientcompressiondistributed learningstatistical error rate

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• Byzantine-resilient distributed state estimation: a min-switching approach
• Communication-efficient algorithms for statistical optimization
• Communication-efficient distributed statistical inference
• Communication-efficient sparse regression
• Distributed secure state estimation for cyber-physical systems under sensor attacks
• Distributed testing and estimation under sparse high dimensional models
• Fault-Tolerant Multi-Agent Optimization
• Nearly unbiased variable selection under minimax concave penalty
• The landscape of empirical risk for nonconvex losses
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Variance reduced median-of-means estimator for Byzantine-robust distributed inference

This page was built for publication: Efficient Byzantine-robust distributed inference with regularization: a trade-off between compression and adversary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571196)