资源分类
》 资源 》论文》Decomposable Submodular Function Minimization Discrete and Continuous

Decomposable Submodular Function Minimization Discrete and Continuous

2020-02-10 | |  54 |   41 |   0

Abstract 

This paper investigates connections between discrete and continuous approaches for decomposable submodular function minimization. We provide improved running time estimates for the state-of-the-art continuous algorithms for the problem using combinatorial arguments. We also provide a systematic experimental comparison of the two types of methods, based on a clear distinction between level-0 and level-1 algorithms.

上一篇：Limitations on Variance-Reduction and Acceleration Schemes for Finite Sum Optimization

下一篇：Learning the Morphology of Brain Signals Using Alpha-Stable Convolutional Sparse Coding

用户评价
全部评价

热门资源

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