A distributed block coordinate descent method for training l₁ regularized linear classifiers

MaRDI QIDQ4637005zbMATH OpenFDO

Authors Dhruv Mahajan, S. S. Keerthi

Publication date 17 April 2018

Full work available at URL https://arxiv.org/abs/1405.4544, http://jmlr.csail.mit.edu/papers/v18/14-484.html

zbMATH Keywords

distributed learning\(l_1\)-regularization

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Distributed algorithms (68W15)

Recommendations

• An efficient distributed learning algorithm based on effective local functional approximations
• Block coordinate descent algorithms for large-scale sparse multiclass classification
• Distributed coordinate descent method for learning with big data
• Block splitting for distributed optimization
• A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation

Cites work

• scientific article; zbMATH DE number 6253925 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
• A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
• A coordinate gradient descent method for nonsmooth separable minimization
• A reliable effective terascale linear learning system
• An improved GLMNET for L1-regularized logistic regression
• Block splitting for distributed optimization
• Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
• Decomposition methods for differentiable optimization problems over Cartesian product sets
• Distributed coordinate descent method for learning with big data
• Distributed iterative thresholding for ℓ₀/ℓ₁-regularized linear inverse problems
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Efficiency of coordinate descent methods on huge-scale optimization problems
• Fast alternating direction optimization methods
• Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
• On the global and linear convergence of the generalized alternating direction method of multipliers
• Parallel Selective Algorithms for Nonconvex Big Data Optimization

Cited in

(13)

• A general distributed dual coordinate optimization framework for regularized loss minimization
• Communication-Efficient Distributed Linear Discriminant Analysis for Binary Classification
• An efficient distributed learning algorithm based on effective local functional approximations
• A distributed training method for L1 regularized kernel machines based on filtering mechanism
• Block splitting for distributed optimization
• Additive-effect assisted learning
• scientific article; zbMATH DE number 7409363 (Why is no real title available?)
• Block coordinate descent algorithms for large-scale sparse multiclass classification
• Distributed Newton Methods for Deep Neural Networks
• The distributed \({L_{1/2}}\) regularization
• scientific article; zbMATH DE number 6982986 (Why is no real title available?)
• A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation
• More communication-efficient distributed sparse learning

Describes a project that uses

Uses Software

• glmnet
• COFFIN

This page was built for publication: A distributed block coordinate descent method for training \(l_1\) regularized linear classifiers

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