L1-Regularized Distributed Optimization: A Communication-Efficient Primal-Dual Framework (2015-12-13T00:00:00.000000Z)

TL;DR

This research presents a novel probabilistic approach to estimating the response of the immune system to laser-spot assisted, 3D image analysis of central nervous system injury.

Abstract

Reference EPFL-REPORT-229241 URL: http://arxiv.org/abs/1512.04011 Record created on 2017-06-21, modified on 2017-07-12

Authors

Martin Jaggi

9 papers

Michael I. Jordan

14 papers

Virginia Smith

6 papers

TL;DR

Abstract

Authors

References35 items

A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization

Primal-Dual Rates and Certificates

Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds

A Dual Augmented Block Minimization Framework for Learning with Limited Memory

Blitz: A Principled Meta-Algorithm for Scaling Sparse Optimization

MLlib: Machine Learning in Apache Spark

Adding vs. Averaging in Distributed Primal-Dual Optimization

SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization

Distributed Coordinate Descent for L1-regularized Logistic Regression

Data/Feature Distributed Stochastic Coordinate Descent for Logistic Regression

Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization

Communication-Efficient Distributed Dual Coordinate Ascent

A distributed block coordinate descent method for training $l_1$ regularized linear classifiers

Accelerated, Parallel, and Proximal Coordinate Descent

Trading Computation for Communication: Distributed Stochastic Dual Coordinate Ascent

Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization

Ad click prediction: a view from the trenches

Parallel Coordinate Descent Newton Method for Efficient $\ell_1$-Regularized Minimization

On the complexity analysis of randomized block-coordinate descent methods

An Equivalence between the Lasso and Support Vector Machines

An improved GLMNET for l1-regularized logistic regression

Parallel Coordinate Descent for L1-Regularized Loss Minimization

Convex Analysis and Monotone Operator Theory in Hilbert Spaces

A Comparison of Optimization Methods and Software for Large-scale L1-regularized Linear Classification

Regularization Paths for Generalized Linear Models via Coordinate Descent.

Stochastic methods for l1 regularized loss minimization

A quasi-Newton approach to non-smooth convex optimization

Scalable training of L1-regularized log-linear models

Smooth minimization of non-smooth functions

Convex Optimization

Distributed Optimization for Non-Strongly Convex Regularizers

Distributed Optimization for Non-Strongly Convex Regularizers

On the duality of strong convexity and strong smoothness : Learning applications and matrix regularization

Techniques of Variational Analysis and Nonlinear Optimization. Canadian Mathematical Society Books in Math

Journal of Machine Learning Research () Submitted 9/12; Published Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization

Field of Study

Journal Information

Name

Volume

Venue Information

Name

Type

URL

Alternate Names