资源分类
》 资源 》论文》Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization

Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization

2020-02-14 | |  68 |   46 |   0

Abstract 

We suggest a general oracle-based framework that captures different parallel stochastic optimization settings described by a dependency graph, and derive generic lower bounds in terms of this graph. We then use the framework and derive lower bounds for several specific parallel optimization settings, including delayed updates and parallel processing with intermittent communication. We highlight gaps between lower and upper bounds on the oracle complexity, and cases where the “natural” algorithms are not known to be optimal.

上一篇：Efficient online algorithms for fast-rate regret bounds under sparsity

下一篇：Adversarially Robust Generalization Requires More Data

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

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

  • A Mathematical Mo...

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