papersSEP 10 04:00 UTC
Sharp Barrier Found for Consistent Submodular Maximization
A new paper proves a hardness limit for consistent submodular maximization, where an algorithm keeps at most k elements while the ground set grows over time. It shows that beating the 2-√2 approximation ratio would force either exponentially many queries or recourse that is linear in the number of arrivals. The result sets a boundary on how much solution quality and stability can be improved at once under a monotone submodular objective.