MANDERA: malicious node detection in federated learning via ranking
From MaRDI portal
Cites work
- A partially linear framework for massive heterogeneous data
- A Scalable Bootstrap for Massive Data
- A split-and-conquer approach for analysis of
- Advances and Open Problems in Federated Learning
- Byzantine-robust distributed sparse learning for M-estimation
- Communication-efficient sparse regression
- Distributed estimation and inference for semiparametric binary response models
- Distributed inference for quantile regression processes
- Divide and conquer in nonstandard problems and the super-efficiency phenomenon
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
- Federated Variance-Reduced Stochastic Gradient Descent With Robustness to Byzantine Attacks
- First-Order Newton-Type Estimator for Distributed Estimation and Inference
- Heterogeneity-aware and communication-efficient distributed statistical inference
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Quasi-Newton updating for large-scale distributed learning
- The Byzantine generals problem
- WONDER: weighted one-shot distributed ridge regression in high dimensions
This page was built for publication: MANDERA: malicious node detection in federated learning via ranking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6835643)
