分块拟阵约束下求次模或单调函数最大值的多目标进化算法
Maximizing Submodular or Monotone Functions under Partition Matroid Constraints by Multi-objective Evolutionary Algorithms
摘要:
许多重要的问题都可以看作是在一定的约束条件下极大化子模函数的问题。一个简单的多目标进化算法称为GSEMO已被证明是实现良好的近似次模函数有效。虽然已经有很多关于这个问题的研究,大多数现有的运行时分析GSEMO假设一个单一的基数约束。在这项工作中,我们将理论结果推广到分区拟阵约束,推广基数约束,并表明GSEMO一般可以保证良好的近似性能多项式预期的运行时间。此外,我们进行了实验比较与基线贪心算法在最大化无向图割随机图,在各种分区拟阵的约束。结果表明,GSEMO在二次运行时间上的性能优于GREEDY。
英文摘要:
Many important problems can be regarded as maximizing submodular functions under some constraints. A simple multi-objective evolutionary algorithm called GSEMO has been shown to achieve good approximation for submodular functions efficiently. While there have been many studies on the subject, most of existing run-time analyses for GSEMO assume a single cardinality constraint. In this work, we extend the theoretical results to partition matroid constraints which generalize cardinality constraints, and show that GSEMO can generally guarantee good approximation performance within polynomial expected run time. Furthermore, we conducted experimental comparison against a baseline GREEDY algorithm in maximizing undirected graph cuts on random graphs, under various partition matroid constraints. The results show GSEMO tends to outperform GREEDY in quadratic run time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。