Communication-efficient estimation for distributed subset selection
From MaRDI portal
Publication:6089198
DOI10.1007/s11222-023-10302-7zbMath1523.62009OpenAlexW4387667360MaRDI QIDQ6089198
No author found.
Publication date: 17 November 2023
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-023-10302-7
Computational methods for problems pertaining to statistics (62-08) Estimation in multivariate analysis (62H12) Linear regression; mixed models (62J05) Applications of statistics to biology and medical sciences; meta analysis (62P10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Best subset selection via a modern optimization lens
- Innovated scalable efficient estimation in ultra-large Gaussian graphical models
- The sparsity and bias of the LASSO selection in high-dimensional linear regression
- Distributed testing and estimation under sparse high dimensional models
- Least angle regression. (With discussion)
- A Constrainedℓ1Minimization Approach to Sparse Precision Matrix Estimation
- Decoding by Linear Programming
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Least-Square Approximation for a Distributed System
- A polynomial algorithm for best-subset selection problem
- Communication-Efficient Distributed Statistical Inference
- Regularization and Variable Selection Via the Elastic Net
- Asymptotic properties for combined L1 and concave regularization
- High Dimensional Thresholded Regression and Shrinkage Effect
This page was built for publication: Communication-efficient estimation for distributed subset selection