Communication-efficient estimation for distributed subset selection

DOI10.1007/S11222-023-10302-7MaRDI QIDQ6089198zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

variable selectionGICdiscrete optimizationdistributed computation

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Linear regression; mixed models (62J05) Applications of statistics to biology and medical sciences; meta analysis (62P10) Estimation in multivariate analysis (62H12)

Recommendations

• Distributed subdata selection for big data via sampling-based approach
• Communication-efficient sparse regression
• Bayesian selection of best subsets via hybrid search
• Optimal subsample selection for massive logistic regression with distributed data
• Communication-efficient estimation of high-dimensional quantile regression

Cites work

• scientific article; zbMATH DE number 6982301 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
• A polynomial algorithm for best-subset selection problem
• Asymptotic properties for combined \(L_{1}\) and concave regularization
• Best subset selection via a modern optimization lens
• Communication-efficient algorithms for statistical optimization
• Communication-efficient distributed statistical inference
• Communication-efficient sparse regression
• Decoding by Linear Programming
• Distributed testing and estimation under sparse high dimensional models
• High dimensional thresholded regression and shrinkage effect
• Innovated scalable efficient estimation in ultra-large Gaussian graphical models
• Least angle regression. (With discussion)
• Least-Square Approximation for a Distributed System
• Nearly unbiased variable selection under minimax concave penalty
• Regularization and Variable Selection Via the Elastic Net
• Scalable interpretable multi-response regression via SEED
• The sparsity and bias of the LASSO selection in high-dimensional linear regression
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

Cited in

(5)

• A distributed feature selection scheme with partial information sharing
• The COR criterion for optimal subset selection in distributed estimation
• Communication-Efficient Pilot Estimation for Non-Randomly Distributed Data in Diverging Dimensions
• Communication-Efficient Accurate Statistical Estimation
• Bias-enhanced support detection and root finding approach

This page was built for publication: Communication-efficient estimation for distributed subset selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089198)