Robust Personalized Federated Learning with Sparse Penalization
From MaRDI portal
Cites work
- A New Semiparametric Approach to Finite Mixture of Regressions using Penalized Regression via Fusion
- Adaptive Huber Regression
- Adaptive robust variable selection
- ADMM for High-Dimensional Sparse Penalized Quantile Regression
- Asymptotic behavior of M-estimators for the linear model
- Asymptotically Minimax Adaptive Estimation. I: Upper Bounds. Optimally Adaptive Estimates
- Composite quantile regression and the oracle model selection theory
- Distributed high-dimensional regression under a quantile loss function
- Exploration of heterogeneous treatment effects via concave fusion
- Fused Lasso approach in regression coefficients clustering -- learning parameter heterogeneity in data integration
- Global convergence of splitting methods for nonconvex composite optimization
- High-dimensional integrative analysis with homogeneity and sparsity recovery
- I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error
- Learning from MOM's principles: Le Cam's approach
- Linearized ADMM Converges to Second-Order Stationary Points for Non-Convex Problems
- Nearly unbiased variable selection under minimax concave penalty
- Regularization, sparse recovery, and median-of-means tournaments
- Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima
- Robust Estimation of a Location Parameter
- Robust machine learning by median-of-means: theory and practice
- Robust regression: Asymptotics, conjectures and Monte Carlo
- Support recovery without incoherence: a case for nonconvex regularization
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(2)
This page was built for publication: Robust Personalized Federated Learning with Sparse Penalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6995024)
