Randomized Kaczmarz in adversarial distributed setting
From MaRDI portal
Publication:6562376
Recommendations
- Resilient penalty function method for distributed constrained optimization under Byzantine attack
- Byzantine-robust distributed sparse learning for \(M\)-estimation
- Byzantine-robust and efficient distributed sparsity learning: a surrogate composite quantile regression approach
- A resilient convex combination for consensus-based distributed algorithms
- Resilient distributed averaging: adversary detection and topological insights
Cites work
- scientific article; zbMATH DE number 1271381 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- A randomized Kaczmarz algorithm with exponential convergence
- Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
- Median-truncated gradient descent: a robust and scalable nonconvex approach for signal estimation
- On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- Quantile-based iterative methods for corrupted systems of linear equations
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- Randomized Kaczmarz solver for noisy linear systems
- Randomized methods for linear constraints: convergence rates and conditioning
- Scikit-learn: machine learning in Python
- Single projection Kaczmarz extended algorithms
- Solving the system of nonsingular tensor equations via randomized Kaczmarz-like method
- The Byzantine Generals Problem
- The Byzantine generals problem
- The Relaxation Method for Linear Inequalities
- The mathematics of computerized tomography
This page was built for publication: Randomized Kaczmarz in adversarial distributed setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562376)