资源分类
》 资源 》论文》Scaling Up Coordinate Descent Algorithms for Large `1 Regularization Problems

Scaling Up Coordinate Descent Algorithms for Large `1 Regularization Problems

2020-02-28 | |  51 |   41 |   0

Abstract

We present a generic framework for parallel coordinate descent (CD) algorithms that includes, as special cases, the original sequential algorithms Cyclic CD and Stochastic CD, as well as the recent parallel Shotgun algorithm. We introduce two novel parallel algorithms that are also special cases—Thread-Greedy CD and ColoringBased CD—and give performance measurements for an OpenMP implementation of these.

上一篇：Copula-based Kernel Dependency Measures

下一篇：Direct Gaussian Process Quantile Regression using Expectation Propagation

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...