资源分类
》 资源 》论文》Distributing Frank-Wolfe via Map-Reduce? Armin Moharrer and Stratis Ioannidis

Distributing Frank-Wolfe via Map-Reduce? Armin Moharrer and Stratis Ioannidis

2019-11-06 | |  60 |   47 |   0
Abstract We identify structural properties under which a convex optimization over the simplex can be massively parallelized via map-reduce operations using the Frank-Wolfe (FW) algorithm. A broad class of problems, e.g., Convex Approximation, Experimental Designs, and Adaboost, can be tackled this way. We implement FW over Apache Spark, and solve problems with 20 million variables using 350 cores in 79 minutes; the same operation takes 165 hours when executed serially.

上一篇：Cost-Based Goal Recognition for the Path-Planning Domain Peta Masters and Sebastian Sardina

下一篇：Completeness-aware Rule Learning from Knowledge Graphs?

用户评价
全部评价

热门资源

  • 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...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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