Efficient distributed optimization for large-scale high-dimensional sparse penalized Huber regression
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new inexact alternating directions method for monotone variational inequalities
- A partially linear framework for massive heterogeneous data
- ADMM for High-Dimensional Sparse Penalized Quantile Regression
- Adaptive Huber Regression
- Asymptotic behavior of M estimators of p regression parameters when \(p^ 2/n\) is large. II: Normal approximation
- Challenging the empirical mean and empirical variance: a deviation study
- Communication-efficient algorithms for statistical optimization
- Communication-efficient distributed optimization of self-concordant empirical loss
- Communication-efficient distributed statistical inference
- Distributed optimization and statistical learning for large-scale penalized expectile regression
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Hankel matrix rank minimization with applications to system identification and realization
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On parameters of increasing dimensions
- On the optimality of averaging in distributed statistical learning
- Robust regression using iteratively reweighted least-squares
- Robust regression: Asymptotics, conjectures and Monte Carlo
- The Adaptive Lasso and Its Oracle Properties
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Efficient distributed optimization for large-scale high-dimensional sparse penalized Huber regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972535)
