Byzantine-robust distributed sparse learning for M-estimation
From MaRDI portal
Byzantine-robust distributed sparse learning for \(M\)-estimation
Recommendations
- Byzantine-robust and efficient distributed sparsity learning: a surrogate composite quantile regression approach
- High-dimensional \(M\)-estimation for Byzantine-robust decentralized learning
- Variance reduced median-of-means estimator for Byzantine-robust distributed inference
- Genuinely distributed Byzantine machine learning
- Distributed adaptive Huber regression
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Adaptive robust variable selection
- Brief announcement: Byzantine-tolerant machine learning
- Communication-Efficient Accurate Statistical Estimation
- Communication-efficient distributed statistical inference
- Distributed high-dimensional regression under a quantile loss function
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed statistical estimation and rates of convergence in normal approximation
- Geometric median and robust estimation in Banach spaces
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- On the ``degrees of freedom of the lasso
- Quantile regression.
- Regularization, sparse recovery, and median-of-means tournaments
- Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima
- Robust machine learning by median-of-means: theory and practice
- Robust regression: Asymptotics, conjectures and Monte Carlo
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Statistics for high-dimensional data. Methods, theory and applications.
- Support recovery without incoherence: a case for nonconvex regularization
- The Byzantine Generals Problem
- The landscape of empirical risk for nonconvex losses
- Tuning parameter selectors for the smoothly clipped absolute deviation method
Cited in
(18)- Genuinely distributed Byzantine machine learning
- Variance reduced median-of-means estimator for Byzantine-robust distributed inference
- Discussion of: ‘A review of distributed statistical inference’
- High-dimensional \(M\)-estimation for Byzantine-robust decentralized learning
- A simplified convergence theory for Byzantine resilient stochastic gradient descent
- Byzantine-robust variance-reduced federated learning over distributed non-i.i.d. data
- Byzantine-robust loopless stochastic variance-reduced gradient
- Randomized Kaczmarz in adversarial distributed setting
- Byzantine-robust and efficient distributed sparsity learning: a surrogate composite quantile regression approach
- MANDERA: malicious node detection in federated learning via ranking
- Distributed semi-supervised single-index model with corruption
- Efficient distributed transfer learning for large-scale Gaussian graphic models
- Adaptive weighted approach for high-dimensional statistical learning and inference
- Sparse and debiased Lasso estimation and statistical inference for long time series via divide-and-conquer
- Byzantine-robust distributed support vector machine
- Decentralized Byzantine-resilient dictionary learning
- Communication-Efficient Pilot Estimation for Non-Randomly Distributed Data in Diverging Dimensions
- Distributed learning with adversarial contamination: an efficient and optimal approach based on dynamic regularization
This page was built for publication: Byzantine-robust distributed sparse learning for \(M\)-estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6053803)
