Emergent Mind
Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
(2405.14995)
Published May 23, 2024
in
cs.DS
,
cs.AI
,
and
cs.LG
Abstract
We show that the greedy algorithm for adaptive-submodular cover has approximation ratio at least 1.3*(1+ln Q). Moreover, the instance demonstrating this gap has Q=1. So, it invalidates a prior result in the paper ``Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization'' by Golovin-Krause, that claimed a (1+ln Q)2 approximation ratio for the same algorithm.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.