Byzantine-robust loopless stochastic variance-reduced gradient
From MaRDI portal
Publication:6134045
DOI10.1007/978-3-031-35305-5_3zbMath1528.90189arXiv2303.04560OpenAlexW4381956520MaRDI QIDQ6134045
Publication date: 21 August 2023
Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.04560
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lectures on convex optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- The Byzantine Generals Problem
- Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization
- Federated Variance-Reduced Stochastic Gradient Descent With Robustness to Byzantine Attacks
- Brief Announcement
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Understanding Machine Learning
- Some methods of speeding up the convergence of iteration methods
- A Stochastic Approximation Method
This page was built for publication: Byzantine-robust loopless stochastic variance-reduced gradient