Communication-Efficient Distributed Sparse Learning with Oracle Property and Geometric Convergence
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 7306878 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- A general theory of concave regularization for high-dimensional sparse estimation problems
- A proximal-gradient homotopy method for the sparse least-squares problem
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- Analysis of multi-stage convex relaxation for sparse regularization
- Calibrating nonconvex penalized regression in ultra-high dimension
- Communication-Efficient Accurate Statistical Estimation
- Communication-efficient distributed statistical inference
- Communication-efficient sparse regression
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- De-noising by soft-thresholding
- Distributed Estimation for Principal Component Analysis: An Enlarged Eigenspace Analysis
- Distributed estimation of principal eigenspaces
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
- Gradient methods for minimizing composite functions
- High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity
- I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error
- Nearly unbiased variable selection under minimax concave penalty
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- Pathwise coordinate optimization
- Quantile regression under memory constraint
- Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Simultaneous analysis of Lasso and Dantzig selector
- Statistical consistency and asymptotic normality for high-dimensional robust \(M\)-estimators
- Strong oracle optimality of folded concave penalized estimation
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Communication-Efficient Distributed Sparse Learning with Oracle Property and Geometric Convergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6878038)
