A communication-efficient method for generalized linear regression with ℓ 0 regularization

DOI10.1080/03610918.2022.2115072MaRDI QIDQ6972479zbMATH OpenFDO

Authors Kun Peng Wang, Xue-rui Li, Yanyan Liu, Lican Kang

Publication date 12 June 2025

Published in Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610918.2022.2115072

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• scientific article; zbMATH DE number 6982922 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• L 1-Regularization Path Algorithm for Generalized Linear Models
• A general theory of concave regularization for high-dimensional sparse estimation problems
• A partially linear framework for massive heterogeneous data
• A split-and-conquer approach for analysis of
• A unified primal dual active set algorithm for nonconvex sparse recovery
• An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
• Block average quantile regression for massive dataset
• Calibrating nonconvex penalized regression in ultra-high dimension
• Communication-efficient algorithms for statistical optimization
• Communication-efficient distributed statistical inference
• Communication-efficient sparse regression
• Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
• Distributed testing and estimation under sparse high dimensional models
• Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
• GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee
• Nearly unbiased variable selection under minimax concave penalty
• On the optimality of averaging in distributed statistical learning
• Rate minimaxity of the Lasso and Dantzig selector for the \(l_{q}\) loss in \(l_{r}\) balls
• Regularization and Variable Selection Via the Elastic Net
• Sparse Approximate Solutions to Linear Systems
• Sure independence screening for ultrahigh dimensional feature space. With discussion and authors' reply
• The Group Lasso for Logistic Regression
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

Cited in

(1)

• Communication-efficient distributed estimation and computation using skew-normal distribution

This page was built for publication: A communication-efficient method for generalized linear regression with ℓ ₀ regularization

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