[论文解读] Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints

Niv Buchbinder, Joseph Joseph+3 more|arXiv (Cornell University)|Jan 1, 2012

Optimization and Search Problems参考文献 12被引用 3

一句话总结

本论文提出了首个针对在拟阵约束下、加权秩函数在线最大化问题的随机化在线近似算法，其中子模奖励按顺序到达。该算法采用基于线性规划的分数解，并结合加权多数更新规则，以及一种新颖的随机舍入方法，利用拟阵多面体覆盖性质，实现了在 m 个元素和 fratio 参数化权重变化情况下的 O(log²n log m log fratio)-竞争比。

ABSTRACT

Consider the following online version of the submodular maximization problem under a matroid constraint. We are given a set of elements over which a matroid is defined. The goal is to incrementally choose a subset that remains independent in the matroid over time. At each time, a new weighted rank function of a different matroid (one per time) over the same elements is presented; the algorithm can add a few elements to the incrementally constructed set, and reaps a reward equal to the value of the new weighted rank function on the current set. The goal of the algorithm as it builds this independent set online is to maximize the sum of these (weighted rank) rewards. As in regular online analysis, we compare the rewards of our online algorithm to that of an offline optimum, namely a single independent set of the matroid that maximizes the sum of the weighted rank rewards that arrive over time. This problem is a natural extension of two well-studied streams of earlier work: the first is on online set cover algorithms (in particular for the max coverage version) while the second is on approximately maximizing submodular functions under a matroid constraint. In this paper, we present the first randomized online algorithms for this problem with poly-logarithmic competitive ratio. To do this, we employ the LP formulation of a scaled reward version of the problem. Then we extend a weighted-majority type update rule along with uncrossing properties of tight sets in the matroid polytope to find an approximately optimal fractional LP solution. We use the fractional solution values as probabilities for a online randomized rounding algorithm. To show that our rounding produces a sufficiently large reward independent set, we prove and use new covering properties for randomly rounded fractional solutions in the matroid polytope that may be of independent interest.

研究动机与目标

• 解决奖励按顺序到达且决策不可撤销的拟阵约束下的在线子模最大化问题。
• 将在线算法从无权重覆盖问题扩展至拟阵的加权秩函数。
• 为此类一般在线优化问题设计一个对数时间复杂度的竞争力比算法。
• 设计一种随机舍入方案，即使在拟阵独立性约束下也能保持性能保证。
• 证明随机舍入的分数解在拟阵多面体中的新覆盖性质，这是分析的关键。

提出的方法

• 通过猜测值 α 来界定奖励，构建在线问题的缩放线性规划松弛。
• 应用类似加权多数的更新规则，以在时间上维持一个近似最优的分数解。
• 利用拟阵多面体中紧集的非交叉性质，指导 LP 更新并确保可行性。
• 设计一种随机舍入过程，按分数 LP 值成比例选择元素。
• 证明在每个时间步，舍入解可被 O(log(mn)) 个独立集以高概率覆盖。
• 结合 LP 近似与舍入分析，推导出涉及 log n、log m 和 fratio 的竞争力比。

实验结果

研究问题

• RQ1 当奖励为加权秩函数时，能否在拟阵约束下实现在线子模最大化问题的对数时间复杂度竞争力比？
• RQ2 在子模函数随时间变化的在线设置中，如何维护一个近似于离线最优解的分数 LP 解？
• RQ3 在拟阵多面体中，随机舍入的分数解会显现出何种覆盖性质？这些性质如何用于性能保证？
• RQ4 如何将算法扩展至处理未知的 n 和未知的 fratio，而使竞争力比的退化不超过对数因子？
• RQ5 是否可能将加权秩函数情形约化为无权重情形，且仅导致竞争力比的对数损失？

主要发现

• 所提出的算法在拟阵约束下实现加权秩函数在线最大化的 O(log²n log m log fratio)-竞争力比。
• 该算法采用随机舍入方案，确保所选集合在拟阵中以高概率保持独立。
• 分析依赖于证明：随机舍入的分数解可被 O(log(mn)) 个独立集以高概率覆盖，这是新颖的结构性结果。
• 当 fratio 未知时，算法通过在权重尺度的猜测值上使用概率分布，使竞争力比额外增加 O(log fratio (log log fratio)^{1+ε}) 因子。
• 当 n 未知时，算法通过以适当概率猜测 α = 2^i 进行自适应调整，使竞争力比额外增加 O(log log n) 因子。
• 竞争力比与已知的下界仅相差对数因子，表明在在线设置下具有近似最优性。