← 研踪 PaperTrailarXiv:2609.15677 · v3
Beyond 1/3-Approximation: Random Greedy for Constrained \(\boldsymbol{k}\)-Submodular Maximization
首次提交 2026-09-14 22:52
版本更新 2026-11-19 13:37
雷达观测 2026-11-20 19:58
摘要
-submodularity generalizes submodularity by allowing each selected element to be assigned one of labels. We study the maximization of a non-monotone -submodular function, where , under matroid and knapsack constraints. We develop a proportional Top-2 randomized framework that achieves an approximation ratio of under either constraint, breaking the previous barrier. Once an element is selected, its label is chosen from the two labels with the largest marginal gains, with probabilities proportional to their positive parts. We further improve the approximation guarantees to under cardinality and knapsack constraints, through a Bellman-style backward induction analysis using the same proportional Top-2 rule. Our guarantees for cardinality and knapsack constraints are asymptotically tight as . They are also tight for . The value-oracle complexities are for cardinality, where is the cardinality bound, for matroid, and for knapsack.
作者备注:40 pages
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v3 · 2026-11-19 13:37 · 最新观测版本
Beyond 1/3-Approximation: Random Greedy for Constrained \(\boldsymbol{k}\)-Submodular Maximization
-submodularity generalizes submodularity by allowing each selected element to be assigned one of labels. We study the maximization of a non-monotone -submodular function, where , under matroid and knapsack constraints. We develop a proportional Top-2 randomized framework that achieves an approximation ratio of under either constraint, breaking the previous barrier. Once an element is selected, its label is chosen from the two labels with the largest marginal gains, with probabilities proportional to their positive parts. We further improve the approximation guarantees to under cardinality and knapsack constraints, through a Bellman-style backward induction analysis using the same proportional Top-2 rule. Our guarantees for cardinality and knapsack constraints are asymptotically tight as . They are also tight for . The value-oracle complexities are for cardinality, where is the cardinality bound, for matroid, and for knapsack.
查看此版本解读 →查看此版本原文 ↗