Optimal complexity in Byzantine-robust distributed stochastic optimization with data heterogeneity

MaRDI QIDQ7308379zbMATH OpenFDO

Authors Qiankun Shi, Jie Peng, Kun Yuan, Xiao Wang, Qing Ling

Publication date 4 August 2026

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://jmlr.org/papers/v26/25-0613.html

Mathematics Subject Classification ID

Distributed algorithms (68W15) Stochastic programming (90C15) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites work

• Adaptivity of stochastic gradient methods for nonconvex optimization
• Brief announcement: A case for Byzantine machine learning
• Distributed Approximate Newton's Method Robust to Byzantine Attackers
• Fault-Tolerant Multi-Agent Optimization
• Federated Variance-Reduced Stochastic Gradient Descent With Robustness to Byzantine Attacks
• Generalization error matters in decentralized learning under Byzantine attacks
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• Lower bounds for finding stationary points I
• Lower bounds for finding stationary points II: first-order methods
• Lower bounds for non-convex stochastic optimization
• Optimization methods for large-scale machine learning
• Robust aggregation for federated learning
• Some methods of speeding up the convergence of iteration methods
• The Byzantine Generals Problem

This page was built for publication: Optimal complexity in Byzantine-robust distributed stochastic optimization with data heterogeneity

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