High-dimensional \(M\)-estimation for Byzantine-robust decentralized learning
From MaRDI portal
Publication:6068679
DOI10.1016/j.ins.2023.119808zbMath1527.62029MaRDI QIDQ6068679
Publication date: 13 November 2023
Published in: Information Sciences (Search for Journal in Brave)
Nonparametric regression and quantile regression (62G08) Linear regression; mixed models (62J05) Convex programming (90C25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Robust machine learning by median-of-means: theory and practice
- Distributed differential privacy via shuffling
- Unsupervised cross-domain rolling bearing fault diagnosis based on time-frequency information fusion
- On the Convergence of Decentralized Gradient Descent
- Adaptation, Learning, and Optimization over Networks
- Adaptive Huber Regression
- The Byzantine Generals Problem
- Monotone Operators and the Proximal Point Algorithm
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
- Distributed Subgradient Methods for Multi-Agent Optimization
- Byzantine-Resilient Multiagent Optimization
- Byzantine-robust distributed sparse learning for \(M\)-estimation
This page was built for publication: High-dimensional \(M\)-estimation for Byzantine-robust decentralized learning