Distributed optimization for penalized regression in massive compositional data
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3772748 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A fully distributed ADMM-based dispatch approach for virtual power plant problems
- A review of compositional data analysis and recent advances
- A review of distributed statistical inference
- A selective review on statistical methods for massive data computation: distributed computing, subsampling, and minibatch techniques
- ADMM for High-Dimensional Sparse Penalized Quantile Regression
- Advances and Open Problems in Federated Learning
- Communication-Efficient Accurate Statistical Estimation
- Communication-Efficient Distributed Linear Discriminant Analysis for Binary Classification
- Communication-efficient algorithms for statistical optimization
- Communication-efficient distributed \(M\)-estimation with missing data
- Communication-efficient distributed covariance sketch, with application to distributed PCA
- Communication-efficient distributed statistical inference
- Communication-efficient estimation and inference for high-dimensional quantile regression based on smoothed decorrelated score
- Communication-efficient sparse composite quantile regression for distributed data
- Communication-efficient surrogate quantile regression for non-randomly distributed system
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Distributed Sparse Linear Regression
- Distributed optimization and statistical learning for large-scale penalized expectile regression
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed quantile regression in decentralized optimization
- Efficient distributed optimization for large-scale high-dimensional sparse penalized Huber regression
- GADMM: fast and communication efficient framework for distributed machine learning
- Generalized linear models with linear constraints for microbiome compositional data
- It's All Relative: Regression Analysis with Compositional Predictors
- Least-Square Approximation for a Distributed System
- Network Gradient Descent Algorithm for Decentralized Federated Learning
- One-step sparse estimates in nonconcave penalized likelihood models
- Pathwise coordinate optimization
- Relative error-based distributed estimation in growing dimensions
- Robust Signal Recovery for High-Dimensional Linear Log-Contrast Models with Compositional Covariates
- Robust communication-efficient distributed composite quantile regression and variable selection for massive data
- Robust regression with compositional covariates
- Statistics for high-dimensional data. Methods, theory and applications.
- The Adaptive Lasso and Its Oracle Properties
- Tuning parameter selection in high dimensional penalized likelihood
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variable selection in regression with compositional covariates
This page was built for publication: Distributed optimization for penalized regression in massive compositional data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993126)
