Decomposable Submodular Function Minimization: Discrete and Continuous
Decomposable Submodular Function Minimization: Discrete and Continuous
复制标题
DOI：
--
复制
发表时间：
2017-03
期刊：
影响因子：
--
通讯作者：
Alina Ene;Huy L. Nguyen;László A. Végh
中科院分区：
文献类型：
--
作者：
Alina Ene;Huy L. Nguyen;László A. Végh
本文研究了离散和连续方法之间的连接，以最小化可分解的下义功能。我们通过组合参数为问题的最新连续算法提供了改进的运行时间估计。我们还基于Level-0和Level-1算法之间的明显区别，对两种方法进行系统的实验比较。
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.