Search papers, labs, and topics across Lattice.
Affiliation:
2
0
3
Online submodular optimization cannot match the classic $1-1/e$ guarantee under stable updates: beating $2-\sqrt{2} \approx 0.5858$ provably triggers either an exponential query explosion or catastrophic $\Omega(k)$ recourse per step.
